The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial
optimization and belongs to the NP-complete classes, which means that it may be require an …

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 …

Multiple traveling salesmen problem (MTSP) is not only a generalization of the traveling
salesman problem (TSP), but also more suitable for modeling practical problems in the real …

A discrete shuffled frog-leaping algorithm based on heuristic information is proposed and
the traveling salesman problem is used as a test problem. First, a new individual generation …

The multiple traveling salesman problem (MTSP) is an important combinatorial optimization
problem. It has been widely and successfully applied to the practical cases in which multiple …

The multiple traveling salesperson problem (MTSP) is similar to famous traveling
salesperson problem (TSP) except for the fact that there are more than one salesperson to …

In this study, we consider the multiple traveling salesmen problem, which is the more
general version of the single traveling salesman problem as it includes m> 1 salesmen …

One of the challenging problems in order picking is how to deal with the congestion
happens in warehouse with multiple pickers. In this paper, we consider an ant colony …

The traveling salesman problem (TSP) is one of the classical combinatorial optimization
problems and has wide application in various fields of science and technology. In the …

The multiple traveling salesman problem (MTSP) is an extension of the traveling salesman
problem (TSP). It is found that the MTSP problem on a three-dimensional sphere has more …