A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods.
Zhao YangMing-Qing XiaoYawei GeDe-long FengLei ZhangHaifang SongXi-Lang TangPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- hybrid algorithm
- traveling salesman problem
- ant colony optimization
- particle swarm optimization
- ant colony optimization algorithm
- metaheuristic
- combinatorial optimization
- simulated annealing
- particle swarm optimization pso
- tabu search
- combinatorial optimization problems
- swarm intelligence
- hybrid method
- artificial bee colony algorithm
- hybrid optimization algorithm
- standard test problems
- genetic algorithm
- optimization problems
- hamiltonian cycle
- vehicle routing problem
- nature inspired
- traveling salesman
- imperialist competitive algorithm
- ant colony algorithm
- benchmark instances
- routing problem
- differential evolution
- job shop scheduling problem
- convergence speed
- pso algorithm
- global optimization
- constraint satisfaction problems
- multi objective