Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic.
Leonora BianchiLuca Maria GambardellaMarco DorigoPublished in: Ant Algorithms (2002)
Keyphrases
- traveling salesman problem
- metaheuristic
- combinatorial optimization
- ant colony optimization
- optimization problems
- path relinking
- simulated annealing
- tabu search
- combinatorial optimization problems
- aco algorithm
- vehicle routing problem
- scatter search
- ant colony optimization algorithm
- combinatorial problems
- nature inspired
- genetic algorithm
- swarm intelligence
- benchmark instances
- search space
- variable neighborhood search
- particle swarm optimization
- optimal solution
- branch and bound
- aco algorithms
- valid inequalities
- ant colony optimization metaheuristic
- minimum spanning tree
- branch and bound algorithm
- ant colony algorithm
- routing problem
- quadratic assignment problem
- crossover operator
- particle swarm optimization pso
- hyper heuristics
- benchmark problems