Guidelines for the use of meta-heuristics in combinatorial optimization.
Alain HertzMarino WidmerPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- combinatorial optimization
- metaheuristic
- simulated annealing
- combinatorial optimization problems
- optimization problems
- tabu search
- ant colony optimization
- traveling salesman problem
- combinatorial problems
- search space
- optimal solution
- path relinking
- scatter search
- branch and bound algorithm
- genetic algorithm
- particle swarm optimization
- search methods
- branch and bound
- vehicle routing problem
- benchmark instances
- nature inspired
- mathematical programming
- memetic algorithm
- exact algorithms
- feasible solution
- hard combinatorial optimization problems
- single machine scheduling problem
- optimization method
- suboptimal solutions
- job shop scheduling problem
- aco algorithm
- genetic algorithm ga
- cost function
- search algorithm
- solution quality
- hybrid algorithm
- design patterns