A Hybrid Particle Swarm Branch-and-Bound (HPB) Optimizer for Mixed Discrete Nonlinear Programming.
S. NemaJohn Yannis GoulermasG. SparrowPhil CookPublished in: IEEE Trans. Syst. Man Cybern. Part A (2008)
Keyphrases
- branch and bound
- particle swarm
- nonlinear programming
- optimization problems
- linear programming
- evolutionary algorithm
- optimization method
- lower bound
- particle swarm optimization
- combinatorial optimization
- branch and bound algorithm
- search algorithm
- optimal solution
- particle swarm optimization algorithm
- swarm intelligence
- search space
- column generation
- variational inequalities
- optimization methods
- multi objective
- upper bound
- differential evolution
- optimization algorithm
- linear constraints
- exact algorithms
- fitness function
- semidefinite programming
- network design problem
- pso algorithm
- genetic algorithm
- max sat
- metaheuristic
- search strategies
- global optimization
- simulated annealing
- finite number
- np hard
- feasible solution
- hybrid algorithm
- objective function
- equality constraints
- benchmark problems
- knapsack problem
- particle swarm optimization pso
- traveling salesman problem
- sensitivity analysis
- sat problem
- evolutionary computation
- genetic algorithm ga
- genetic programming
- mixed integer programming
- graphical models
- scheduling problem
- dynamic programming
- special case