A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems.
José E. GallardoCarlos CottaAntonio J. FernándezPublished in: Congress on Evolutionary Computation (2005)
Keyphrases
- hybrid model
- branch and bound
- combinatorial optimization problems
- evolutionary algorithm
- combinatorial optimization
- optimization problems
- simulated annealing
- metaheuristic
- branch and bound algorithm
- multi objective
- artificial neural networks
- column generation
- traveling salesman problem
- lower bound
- beam search
- differential evolution
- benchmark problems
- hybrid models
- search algorithm
- knapsack problem
- optimal solution
- search strategies
- support vector regression
- job shop scheduling problem
- branch and bound procedure
- multi objective optimization
- genetic algorithm
- branch and bound method
- search space
- tabu search
- upper bound
- estimation of distribution algorithms
- min cost
- max sat
- ant colony optimization
- branch and bound search
- tree search
- partial solutions
- support vector machine svm
- vehicle routing problem
- lagrangian heuristic
- multiple knapsack
- particle swarm optimization algorithm