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

A hybrid artificial bee colony algorithm (AC-ABC) with high robustness is proposed to solve
the multiple traveling salesman problem (MTSP) with multiple depots. It initially conducts …

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 …

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 multiple depot multiple travel salesman problem (MD-MTSP) is a common research
problem in several mobile robots applications. The problem is known to be NP-hard and …

The paper addresses the problem of assigning robots to target locations in the context of a
disaster management scenario, while minimizing a set of pre-defined objectives. The …

The multi-traveling salesmen problem (MTSP) is an extended situation of the standard
traveling salesman problem (TSP), in which there is more than one salesman. In this matter …

This study aims to enhance dynamic programming techniques for efficiently solving the
Traveling Salesman Problem, a fundamental combinatorial optimization challenge. Given its …

Özet Bu doktora çalışması, bir çoklu robot sisteminin karmaşık bir görevi tümüyle otonom
olarak yerine getirmek üzere görev paylaşımı, atama ve yürütme problemini hedef almıştır …

I first came to focus on distributed intelligence and multi-entity cooperation in 2002, and I am
always impressed by the way a group or community constitute a great power morally or …