Computation and Simulation Analysis of a Kind of Multiple Traveling Salesman problem
Explore this paper's citation graph
Summary
A special case of multiple traveling salesman problem was calculated by adopting Lin-Kernighan algorithm, then a two stage procedure was applied in order to make sure that the number of cities each traveling salesman visited are the same and the total tour length is minimized.
- Type
- article
- Published
- 2009-01-01
- Cited by
- 0
- References
- 0
- OpenAlex
- https://openalex.org/W2359992618
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:124417966
Keywords
Travelling salesman problem, 2-opt, Bottleneck traveling salesman problem, Traveling purchaser problem, Mathematical optimization
References
No references recorded for this paper.
Cited by
No citing papers recorded for this paper.
Related papers
- Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
- Real-Life Traveling-Salesman Problem
- Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
- Solving asymmetric traveling salesman problem using genetic algorithm
- An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems
- The traveling salesman problem and its variations
- Traveling Salesman Problem with Transportation
- A transformation for a Multiple Depot, Multiple Traveling Salesman Problem