Metaheuristics for the tabu clustered traveling salesman problem.
Tianjiao ZhangLiangjun KeJing LiJisheng LiJingqi HuangZexi LiPublished in: Comput. Oper. Res. (2018)
Keyphrases
- traveling salesman problem
- tabu search
- combinatorial optimization
- metaheuristic
- path relinking
- ant colony optimization
- optimization problems
- vehicle routing problem
- variable neighborhood search
- nature inspired
- combinatorial problems
- simulated annealing
- combinatorial optimization problems
- benchmark instances
- search procedure
- job shop scheduling problem
- hamiltonian cycle
- scatter search
- neighborhood search
- optimal solution
- feasible solution
- ant colony optimization algorithm
- evolutionary algorithm
- crossover operator
- discrete particle swarm optimization
- minimum spanning tree
- search methods
- memetic algorithm
- genetic local search
- aco algorithm
- routing problem
- swarm intelligence
- branch and bound
- valid inequalities
- search heuristics
- scheduling problem
- search space
- traveling salesman
- objective function
- discrete optimization problems
- genetic algorithm
- solution quality
- particle swarm optimization