MPSA: A Methodology to Parallelize Simulated Annealing and Its Application to the Traveling Salesman Problem.
Héctor Sanvicente SánchezJuan Frausto SolísPublished in: MICAI (2002)
Keyphrases
- traveling salesman problem
- simulated annealing
- combinatorial optimization
- simulated annealing algorithm
- metaheuristic
- ant colony optimization
- combinatorial optimization problems
- neighborhood search
- combinatorial problems
- optimization problems
- genetic algorithm
- evolutionary algorithm
- ant colony optimization algorithm
- tabu search
- discrete particle swarm optimization
- valid inequalities
- hamiltonian cycle
- transportation networks
- traveling salesman
- hill climbing
- hybrid algorithm
- nature inspired
- vehicle routing problem
- global optimum
- crossover operator
- solution quality
- particle swarm optimization pso
- discrete optimization problems
- search algorithm
- lin kernighan
- subtour elimination
- quadratic assignment problem
- linear programming
- dynamic programming
- search space
- similarity measure