A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule
- 4 January 2024
- book chapter
- Published by Springer Nature
- p. 356-370
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic AlgorithmThe Scientific World Journal, 2014
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problemComputers & Operations Research, 2013
- Inventory Routing ProblemTransportation Research Record: Journal of the Transportation Research Board, 2013
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows2013
- The hierarchical traveling salesman problemOptimization Letters, 2012
- A Genetic Algorithm for the Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters1998
- Variable neighborhood searchComputers & Operations Research, 1997
- A tabu search heuristic using genetic diversification for the clustered traveling salesman problemJournal of Heuristics, 1997
- The Clustered Traveling Salesman Problem: A Genetic Approach1996
- The clustered traveling salesman problemComputers & Operations Research, 1975