This paper proposes a new crossover operator called two-part chromosome crossover
(TCX) for solving the multiple travelling salesmen problem (MTSP) using a genetic algorithm …

Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …

A fundamental variant of the classical traveling salesman problem (TSP) is the so-called
multiple TSP (mTSP), where a set of m salesmen jointly visit all cities from a set of n cities …

The travelling salesman problem (TSP) is perhaps the most researched problem in the field
of Computer Science and Operations. It is a known NP-hard problem and has significant …

In this work, we investigate a generalization of the classical capacitated arc routing problem,
called the Multi-depot Capacitated Arc Routing Problem (MCARP). We give exact and …

We study a generalization of the classical traveling salesman problem, where multiple
salesmen are positioned at different depots, of which only a limited number (k) can be …

We study a natural extension of the classical traveling salesman problem (TSP) in the
situation where multiple salesmen are dispatched from a number of different depots. As with …

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 …

This paper studies the m-Steiner Traveling Salesman Problem with online edge blockages.
Under the assumption that there might be some blockages on the roads which are non …

A multidepot capacitated vehicle routing problem aims to serve customers' demands using a
fleet of capacitated vehicles located in multiple depots, such that the total travel cost of the …