Opposition-based barebones particle swarm for constrained nonlinear optimization problems
Summary: We present a modified barebones particle swarm optimization (OBPSO) to solve constrained nonlinear optimization problems. The proposed approach OBPSO combines barebones particle swarm optimization (BPSO) and opposition-based learning (OBL) to improve the quality of solutions. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search region. Moreover, an adaptive penalty method is employed to handle constraints. To verify the performance of OBPSO, a set of well-known constrained benchmark functions is used in the experiments. Simulation results show that our approach achieves a promising performance.
- AI 2005: Advances in Artificial Intelligence
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
- Constrained optimization with an improved particle swarm optimization algorithm
- An improved particle swarm optimization algorithm for solving constrained optimization problems
- Co-evolutionary particle swarm optimization to solve constrained optimization problems
- An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization
- An adaptive penalty scheme for genetic algorithms in structural optimization
- Bare bones differential evolution
- Constrained particle swarm optimization using a bi-objective formulation
- Differential Evolution Via Exploiting Opposite Populations
- Dynamic-objective particle swarm optimization for constrained optimization problems
- Self-adaptive velocity particle swarm optimization for solving constrained optimization problems
This page was built for publication: Opposition-based barebones particle swarm for constrained nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955161)
