Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing - tabu search algorithm to solve the symmetrical traveling salesman problem.
Yu LinZheyong BianXiang LiuPublished in: Appl. Soft Comput. (2016)
Keyphrases
- traveling salesman problem
- tabu search algorithm
- neighborhood search
- simulated annealing
- neighborhood structure
- combinatorial optimization
- tabu search
- path relinking
- minimum spanning tree
- metaheuristic
- solution quality
- ant colony optimization
- job shop scheduling problem
- vehicle routing problem
- optimization problems
- evolutionary algorithm
- crossover operator
- combinatorial optimization problems
- benchmark instances
- test instances
- variable neighborhood search
- nature inspired
- genetic algorithm
- search procedure
- test problems
- memetic algorithm
- graph model
- genetic algorithm ga
- benchmark problems
- hybrid algorithm
- neural network
- feasible solution
- particle swarm optimization
- pairwise
- optimal solution