An efficient GPU implementation of a multi-start TSP solver for large problem instances.
Kamil RockiReiji SudaPublished in: GECCO (Companion) (2012)
Keyphrases
- gpu implementation
- multi start
- traveling salesman problem
- path relinking
- global optimization
- real time
- stochastic approximation
- tabu search
- vehicle routing problem with time windows
- metaheuristic
- ant colony optimization
- search space
- genetic algorithm
- computationally efficient
- branch and bound
- combinatorial optimization
- graphics processing units
- scatter search
- monte carlo
- optimization problems
- general purpose
- optimal solution