SimILS: a simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization.
Alex GrasasAngel A. JuanHelena R. LourençoPublished in: J. Simulation (2016)
Keyphrases
- metaheuristic
- combinatorial optimization
- iterated local search
- tabu search
- combinatorial optimization problems
- simulated annealing
- ant colony optimization
- optimization problems
- traveling salesman problem
- search space
- vehicle routing problem
- combinatorial problems
- scatter search
- branch and bound algorithm
- multi start
- genetic algorithm
- solution space
- branch and bound
- path relinking
- mathematical programming
- optimal solution
- benchmark instances
- particle swarm optimization
- monte carlo
- hard combinatorial optimization problems
- variable neighborhood descent
- exact algorithms
- feasible solution
- single machine scheduling problem
- memetic algorithm
- search algorithm
- heuristic methods
- search procedures
- shortest path
- genetic programming
- special case
- computational complexity