Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing.
C. S. JeongM. H. KimPublished in: ASAP (1990)
Keyphrases
- parallel algorithm
- traveling salesman problem
- simulated annealing
- combinatorial optimization
- metaheuristic
- ant colony optimization
- tabu search
- parallel computation
- optimization problems
- evolutionary algorithm
- genetic algorithm
- hamiltonian cycle
- vehicle routing problem
- hill climbing
- branch and bound
- parallel programming
- traveling salesman
- solution quality
- binary search trees
- parallel implementations
- processor array
- genetic local search
- medial axis transform
- crossover operator
- shared memory
- parallel computers
- subtour elimination
- cluster of workstations