Constrained particle swarm optimisation for sequential quadratic programming Online publication date: Wed, 09-Dec-2009
by Zach D. Richards
International Journal of Modelling, Identification and Control (IJMIC), Vol. 8, No. 4, 2009
Abstract: Sequential quadratic programming (SQP) methods are commonly used to solve constrained non-linear optimisation problems. However, in recent years there has been great improvement in using evolutionary algorithms to solve non-linear optimisations problems. The difficulty has been determining a correct method for implementing evolutionary algorithm for a non-linear optimisation problem with constraints. In this paper, we are combining the strengths of the traditional SQP method with an evolutionary algorithm, particle swarm optimisation (PSO) for solving a constrained non-linear optimisation problem with equality and inequality constraints. We propose a constrained PSO algorithm be used to solve the quadratic programming (QP) subproblem within the SQP method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com