Dynamic-objective particle swarm optimization for constrained optimization problems
This paper firstly presents a novel constraint-handling technique, called dynamic-objective method (DOM), based on the search mechanism of the particles of particle swarm optimization (PSO). DOM converts the constrained optimization problem into a bi-objective optimization problem, and then enables each particle to dynamically adjust its objectives according to its current position in the search space. Neither Pareto ranking nor user-defined parameters are involved in DOM. Secondly, a new PSO-based algorithm—restricted velocity PSO (RVPSO)—is proposed to specialize in solving constrained optimization problems. The performances of DOM and RVPSO are evaluated on 13 well-known benchmark functions, and comparisons with some other PSO algorithms are carried out. Experimental results show that DOM is remarkably efficient and effective, and RVPSO enhanced with DOM exhibits greater performance. In addition, besides the commonly used measures, we use histogram of the test results to evaluate the performance of the algorithms.
KeywordsConstrained optimization Particle swarm optimization Constraint-handling Evolutionary computation
Unable to display preview. Download preview PDF.
- Coath G, Halgamuge SK (2003) A comparison of constraint-handling methods for the application of particle swarm optimization to constrained nonlinear optimization problems. In: Proceedings of the 2003 congress on evolutionary computation. IEEE, pp 2419–2425Google Scholar
- Coello CAC (2000) Treating constraints as objectives for single objective evolutionary computations. Eng Opt 32:275–308Google Scholar
- Hu X, Eberhart RC (2002) Solving constrained nonlinear optimization problems with particle swarm optimization. In: Proceedings of 6th world multiconference on systemics, cybernetics and informatics (SCI 2002), Orlando, USAGoogle Scholar
- Hu X, Eberhart RC, Shi YH (2003) Engineering optimization with particle swarm. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium, pp 53–57Google Scholar
- Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proc. IEEE Int. Conf. on Neural Networks, Perth, Australia, pp 1942–1948Google Scholar
- Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evolut Comput 4(1):1–32Google Scholar
- Shi Y, Krohling RA (2002) Co-evolutionary particle swarm optimization to solve min-max problems. In: Proceedings of 2002 IEEE congress on evolutionary computation. Honolulu, HI, pp 1682–1687Google Scholar
- Pulido GT, Coello Coello Ca (2004) A constraint-handling mechanism for particle swarm optimization. In: Proceedings of the 2004 congress on evolutionary computation. IEEE, pp 1396–1403Google Scholar
- Zavala M, Hernández Aguirre AE, A and ER Villa Diharce (2005) Constrained optimization via particle evolutionary swarm optimization algorithm (PESO). GECCO’05, Washington, DC, USA, pp 209–216Google Scholar