GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem.
Mário MestriaLuiz Satoru OchiSimone de Lima MartinsPublished in: Comput. Oper. Res. (2013)
Keyphrases
- traveling salesman problem
- path relinking
- grasp with path relinking
- satisfy the triangle inequality
- combinatorial optimization
- ant colony optimization
- metaheuristic
- optimization problems
- traveling salesman
- hamiltonian cycle
- genetic local search
- crossover operator
- vehicle routing problem
- routing problem
- solution quality
- knapsack problem
- linear programming
- decision trees