Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound.
José E. GallardoCarlos CottaAntonio J. FernándezPublished in: IWINAC (2) (2005)
Keyphrases
- branch and bound
- evolutionary algorithm
- multidimensional knapsack problem
- combinatorial optimization
- evolutionary strategy
- optimization problems
- simulated annealing
- knapsack problem
- integer programming problems
- tabu search
- genetic algorithm
- branch and bound algorithm
- crossover operator
- branch and bound search
- search algorithm
- lower bound
- metaheuristic
- multi objective
- column generation
- optimal solution
- evolutionary computation
- search space
- memetic algorithm
- differential evolution
- implicit enumeration
- bnb adopt
- lagrangian relaxation
- genetic algorithm ga
- combinatorial optimization problems
- particle swarm optimization
- branch and bound procedure
- search heuristics
- upper bound
- job shop scheduling problem
- network design problem
- partial solutions
- traveling salesman problem
- multi objective optimization
- fitness function
- genetic programming
- branch and bound method
- lagrangian heuristic
- max sat
- mutation operator
- constrained optimization
- test problems
- neural network
- tree search
- multiple choice
- benchmark problems
- previously solved
- variable length
- vehicle routing problem
- feasible solution
- optimization algorithm
- probabilistic model
- np hard