Constrained evolution algorithm based on adaptive differential evolution Online publication date: Mon, 21-May-2018
by Kangshun Li; Liang Zhong; Lei Zuo; Zhaopeng Wang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 11, No. 3, 2018
Abstract: Solving constrained optimisation is widely used in science and engineering, but the slow convergence speed and premature are the biggest problems researchers face. Research on a constrained evolution algorithm (CO-JADE) based on adaptive differential evolution (JADE) for solving the constrained optimisation problems is proposed in this paper. According to features of the Gaussian distribution, the Cauchy distribution and the mutation factor, we exploited the crossover probability of each individual to improve the search strategy. Aimed to effectively evaluate the relationship between the value of the objective function and the degree of constraint violation, the paper used an improved adaptive tradeoff model to evaluate the individuals of the population. This tradeoff model used different treatment scheme for different stages of the population and implemented on night standard test functions. The experimental shows that the CO-JADE has better accuracy and stability than the COEA/ODE and the HCOEA.
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 High Performance Computing and Networking (IJHPCN):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook