Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP).
Jun GuXiaofei HuangPublished in: IEEE Trans. Syst. Man Cybern. Syst. (1994)
Keyphrases
- traveling salesman problem
- search space
- combinatorial optimization
- ant colony optimization
- neighborhood search
- lin kernighan
- metaheuristic
- traveling salesman
- search algorithm
- optimization problems
- combinatorial optimization problems
- path relinking
- ant colony optimization algorithm
- combinatorial problems
- branch and bound
- optimal solution
- tabu search
- vehicle routing problem
- crossover operator
- nature inspired
- aco algorithm
- valid inequalities
- hamiltonian cycle
- variable neighborhood search
- global search
- discrete particle swarm optimization
- simulated annealing
- neural network
- discrete optimization problems
- subtour elimination
- genetic algorithm
- heuristic search
- fitness function
- dynamic programming
- objective function