Hybrid meta-heuristics for combinatorial optimization.
Tommaso UrliPublished in: Constraints An Int. J. (2015)
Keyphrases
- combinatorial optimization
- metaheuristic
- simulated annealing
- combinatorial optimization problems
- optimization problems
- tabu search
- traveling salesman problem
- combinatorial problems
- ant colony optimization
- scatter search
- search space
- genetic algorithm
- greedy randomized adaptive search procedure
- simulated annealing and tabu search
- optimal solution
- path relinking
- vehicle routing problem
- mathematical programming
- branch and bound
- branch and bound algorithm
- search methods
- hard combinatorial optimization problems
- particle swarm optimization
- benchmark instances
- nature inspired
- evolutionary algorithm
- optimization method
- memetic algorithm
- quadratic assignment problem
- job shop scheduling problem
- submodular functions
- set of benchmark instances