Two-phase Pareto local search for the biobjective traveling salesman problem.
Thibaut LustJacques TeghemPublished in: J. Heuristics (2010)
Keyphrases
- traveling salesman problem
- pareto local search
- variable neighborhood search
- neighborhood search
- bi objective
- ant colony optimization
- combinatorial optimization
- optimization problems
- path relinking
- ant colony optimization algorithm
- combinatorial problems
- combinatorial optimization problems
- crossover operator
- vehicle routing problem
- minimum spanning tree
- benchmark instances
- metaheuristic
- efficient solutions
- nature inspired
- multi objective
- routing problem
- genetic algorithm
- swarm intelligence
- network design
- tabu search
- simulated annealing
- set covering problem