On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques.
José E. GallardoCarlos CottaAntonio J. FernándezPublished in: IEEE Trans. Syst. Man Cybern. Part B (2007)
Keyphrases
- branch and bound
- memetic algorithm
- combinatorial optimization
- tabu search
- search algorithm
- branch and bound algorithm
- lower bound
- assembly line balancing
- hybrid algorithm
- search space
- simulated annealing
- column generation
- traveling salesman problem
- upper bound
- network design problem
- metaheuristic
- genetic algorithm
- branch and bound procedure
- optimization problems
- beam search
- tree search
- optimal solution
- evolutionary computation
- randomly generated problems
- tree search algorithm
- mathematical programming
- branch and bound search
- vehicle routing problem
- branch and bound method
- evolutionary algorithm
- crossover operator
- search strategies
- dna computing
- max sat
- feasible solution
- assembly line
- expert systems
- bnb adopt