Reference Line Guided Pareto Local Search for Bi-Objective Traveling Salesman Problem.
Chao XiaXinye CaiZhun FanMuhammad SulamanPublished in: CSE/EUC (1) (2017)
Keyphrases
- bi objective
- traveling salesman problem
- ant colony optimization
- pareto local search
- neighborhood search
- metaheuristic
- set covering problem
- multi objective
- combinatorial optimization problems
- swarm intelligence
- routing problem
- combinatorial optimization
- ant colony optimization algorithm
- efficient solutions
- particle swarm optimization
- nature inspired
- shortest path problem
- variable neighborhood search
- path relinking
- multiple objectives
- optimization problems
- multi objective optimization
- genetic algorithm
- vehicle routing problem
- network design
- minimum spanning tree
- hybrid algorithm
- search space
- benchmark instances
- knapsack problem
- tabu search
- optimal solution