In this paper, we propose a quantum computing oriented benchmark for combinatorial
optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally …

One of the most studied extensions of the famous Traveling Salesperson Problem (TSP) is
the {\sc Multiple TSP}: a set of $ m\geq 1$ salespersons collectively traverses a set of $ n …

Due to climate change, some areas in the world witnessed higher levels of heavy rain than
the capacity of the wastewater system of the streets. Therefore, water tankers are used for …

Multiple TSP ($\mathrm {mTSP} $) is a important variant of $\mathrm {TSP} $ where a set of
$ k $ salesperson together visit a set of $ n $ cities. The $\mathrm {mTSP} $ problem has …

Electric vehicle (EV) charging spots require frequent inspections to identify potential safety
hazards, and charging piles in charging spots exhibit a significant failure rate, necessitating …

This paper considers a Min-Max Multiple Traveling Salesman Problem (MTSP), where the
goal is to find a set of tours, one for each agent, to collectively visit all the cities while …

In this study, we investigate the problem of finding energy-efficient routes for multiple drones
conducting a surface-wave seismic survey. The survey utilizes one seismic source and …

This paper introduces a novel approach to solving the Multi-Depot Multiple Traveling
Salesman Problem (MDMTSP), an extension of the classic Traveling Salesman Problem …

Robotic shepherding is a bio-inspired approach to autonomously guiding a swarm of agents
towards a desired location. The research area has earned increasing research interest …

Abstract Traveling Salesman Problem (TSP) is a well-known NP-complete problem, which
has a very wide range of applications in reality. To solve TSP effectively will promote various …