Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 104 (1998) 113-128).
César RegoPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- traveling salesman problem
- metaheuristic
- ant colony optimization
- combinatorial optimization
- optimization problems
- path relinking
- combinatorial optimization problems
- simulated annealing
- tabu search
- benchmark instances
- combinatorial problems
- vehicle routing problem
- scatter search
- search space
- nature inspired
- swarm intelligence
- optimal solution
- search methods
- genetic algorithm
- ant colony optimization algorithm
- evolutionary algorithm
- traveling salesman
- variable neighborhood search
- valid inequalities
- branch and bound
- cost function
- benchmark problems
- branch and bound algorithm
- particle swarm optimization
- objective function
- knapsack problem
- single machine scheduling problem
- aco algorithm
- job shop scheduling problem
- routing problem
- test problems
- aco algorithms