The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization.
Weitian WuXinmin YangPublished in: CoRR (2022)
Keyphrases
- branch and bound
- multiobjective optimization
- combinatorial optimization
- optimization problems
- multi objective
- nsga ii
- optimal solution
- objective function
- metaheuristic
- evolutionary algorithm
- branch and bound algorithm
- lower bound
- min max
- hybrid algorithm
- particle swarm optimization
- swarm intelligence
- search algorithm
- test problems
- upper bound
- traveling salesman problem
- column generation
- artificial immune system
- tabu search
- branch and bound procedure
- search space
- ant colony optimization
- combinatorial optimization problems
- beam search
- genetic algorithm
- pareto optimal
- randomly generated problems
- multiple objectives
- simulated annealing
- convex optimization
- tree search algorithm
- branch and bound method
- knapsack problem
- mathematical programming
- cost function
- tree search
- artificial bee colony
- multi objective optimization
- vehicle routing problem
- optimization algorithm
- dna computing
- memetic algorithm
- evolutionary computation
- branch and bound search
- linear program
- feasible solution
- job shop scheduling problem
- particle swarm optimization pso
- scheduling problem
- bnb adopt
- lagrangian heuristic