The multiple traveling salesman problem: an overview of formulations and solution procedures
T Bektas - omega, 2006 - Elsevier
The multiple traveling salesman problem (mTSP) is a generalization of the well-known
traveling salesman problem (TSP), where more than one salesman is allowed to be used in …
traveling salesman problem (TSP), where more than one salesman is allowed to be used in …
Traveling salesman problem: an overview of applications, formulations, and solution approaches
The traveling salesman problem (TSP) were studied in the 18th century by a mathematician
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …
A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem
S Mahmoudinazlou, C Kwon - Computers & Operations Research, 2024 - Elsevier
This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman
Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a …
Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a …
A review of planning and scheduling systems and methods for integrated steel production
Iron and steel industry is an essential and sizable sector for industrialized economies. Since
it is capital and energy extensive, companies have been putting consistent emphasis on …
it is capital and energy extensive, companies have been putting consistent emphasis on …
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
AE Carter, CT Ragsdale - European journal of operational research, 2006 - Elsevier
The multiple traveling salesperson problem (MTSP) involves scheduling m> 1 salespersons
to visit a set of n> m locations so that each location is visited exactly once while minimizing …
to visit a set of n> m locations so that each location is visited exactly once while minimizing …
A review of planning and scheduling methods for hot rolling mills in steel production
Modern steel production centers on the hot rolling mill as a key component. Scheduling for
hot rolling mills is a challenging problem that has fascinated optimization researchers and …
hot rolling mills is a challenging problem that has fascinated optimization researchers and …
A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
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 …
(TCX) for solving the multiple travelling salesmen problem (MTSP) using a genetic algorithm …
A new efficient hybrid algorithm for large scale multiple traveling salesman problems
C Jiang, Z Wan, Z Peng - Expert Systems with Applications, 2020 - Elsevier
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 …
salesman problem (TSP), but also more suitable for modeling practical problems in the real …
Integer linear programming formulations of multiple salesman problems and its variations
In this paper, we extend the classical multiple traveling salesman problem (mTSP) by
imposing a minimal number of nodes that a traveler must visit as a side condition. We …
imposing a minimal number of nodes that a traveler must visit as a side condition. We …
Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem
SKR Kanna, K Sivakumar, N Lingaraj - Knowledge-Based Systems, 2021 - Elsevier
Abstract Traveling Salesman Problem (TSP) has been seen in diverse applications, which is
proven to be NP-complete in most cases. Even though there are multiple heuristic …
proven to be NP-complete in most cases. Even though there are multiple heuristic …