A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines.
Dennis WeylandRoberto MontemanniLuca Maria GambardellaPublished in: J. Parallel Distributed Comput. (2013)
Keyphrases
- metaheuristic
- combinatorial optimization problems
- combinatorial optimization
- ant colony optimization
- optimization problems
- simulated annealing
- scatter search
- tabu search
- optimal solution
- knapsack problem
- genetic algorithm
- vehicle routing problem
- search methods
- traveling salesman problem
- search space
- combinatorial problems
- job shop scheduling problem
- job shop scheduling
- particle swarm optimization
- variable neighborhood search
- exact algorithms
- neural network
- path relinking
- iterated local search
- mathematical programming
- nature inspired