A two-level metaheuristic for the all colors shortest path problem.
Francesco CarrabsRaffaele CerulliRosa PentangeloAndrea RaiconiPublished in: Comput. Optim. Appl. (2018)
Keyphrases
- shortest path problem
- metaheuristic
- combinatorial optimization problems
- ant colony optimization
- optimization problems
- single source
- tabu search
- combinatorial optimization
- simulated annealing
- shortest path
- genetic algorithm
- scatter search
- interval data
- search space
- particle swarm optimization
- search methods
- path relinking
- vehicle routing problem
- bi objective
- optimal solution
- benchmark instances
- iterated local search
- variable neighborhood search
- nature inspired
- job shop scheduling problem
- harmony search
- directed graph
- directed acyclic graph
- guided local search
- multi start
- suboptimal solutions
- evolutionary algorithm
- set of benchmark instances
- metaheuristic algorithms
- ant colony optimization metaheuristic
- knapsack problem
- random walk
- search algorithm
- bayesian networks