A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule.
Kasi Viswanath DasariAlok SinghRammohan MallipeddiPublished in: ICDCIT (2024)
Keyphrases
- traveling salesman problem
- variable neighborhood search
- neighborhood search
- path relinking
- combinatorial optimization
- benchmark instances
- optimization problems
- vehicle routing problem
- ant colony optimization
- combinatorial problems
- special case
- metaheuristic
- combinatorial optimization problems
- traveling salesman
- routing problem
- minimum spanning tree
- valid inequalities
- genetic algorithm
- heuristic methods
- tabu search
- optimal solution
- message passing
- branch and bound
- search space
- neural network