Abstract The Multiple Traveling Salesman Problem (MTSP) is among the most interesting
combinatorial optimization problems because it is widely adopted in real-life applications …

In this paper, we consider the use of a team of multiple unmanned aerial vehicles (UAVs) to
accomplish a search and rescue (SAR) mission in the minimum time possible while saving …

Multiple traveling salesman problem (MTSP) is a generalization of the classic traveling
salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications …

This paper considers the problem of having a team of mobile robots to visit a set of target
locations. This problem is known as multi-robot patrolling problems. In this paper, the …

The combination of wireless sensor networks (WSNs) and 3D virtual environments opens a
new paradigm for their use in natural disaster management applications. It is important to …

The objective of the book is to provide the reader with a comprehensive coverage of two
important research problems in mobile robots, namely global path planning and cooperative …

This paper considers the problem of assigning target locations to be visited by mobile
robots. We formulate the problem as a multiple-depot multiple traveling salesman problem …

Visiting constrained multiple traveling salesmen problem (VCMTSP) is an extension of the
multiple traveling salesmen problem (MTSP). In this problem, each city is restricted to be …

Consider the problem of having a team of cooperative and autonomous robots to repeatedly
visit a set of target locations and return back to their initial locations. This problem is known …

The balanced multiple traveling salesmen problem (BMTSP) is a challenging combinatorial
optimization problem with many practical applications. However, as the scale of the problem …