A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
From MaRDI portal
Publication:826328
DOI10.1016/J.COSREV.2021.100369zbMath1487.90545arXiv2102.12772OpenAlexW3130706049MaRDI QIDQ826328
Omar Cheikhrouhou, Ines Khoufi
Publication date: 20 December 2021
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.12772
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (5)
Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ Routing problems with electric and autonomous vehicles: review and potential for future research ⋮ Research on improved ant colony optimization for traveling salesman problem
Cites Work
- The analytic hierarchy process—what it is and how it is used
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- Rich vehicle routing problems: from a taxonomy to a definition
- Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
- Evolutionary Multi-Criterion Optimization
- A Survey of the Generalized Assignment Problem and Its Applications
This page was built for publication: A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy