A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem.
Predrag StanojevicMiroslav MaricZorica StanimirovicPublished in: Appl. Soft Comput. (2015)
Keyphrases
- branch and bound
- evolutionary algorithm
- combinatorial optimization
- network design problem
- lower bound
- integer programming problems
- depth first search
- branch and bound algorithm
- search algorithm
- branch and bound search
- optimization problems
- upper bound
- column generation
- search space
- optimal solution
- simulated annealing
- metaheuristic
- partial solutions
- tree search
- beam search
- branch and bound procedure
- branch and bound method
- multi objective
- tree search algorithm
- implicit enumeration
- bnb adopt
- randomly generated problems
- routing problem
- search heuristics
- vehicle routing problem
- search strategies
- genetic algorithm
- traveling salesman problem
- differential evolution
- integer program
- dna computing
- lagrangian heuristic
- search tree