Dynamic and random differential evolution solving constrained optimisation problems Online publication date: Sat, 20-Sep-2014
by Qing Zhang; Sanyou Zeng; Changhe Li
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 2, 2014
Abstract: A dynamic and random differential evolution (DRDE) is designed in this paper to solve constrained optimisation problems (COPs). The dynamic means that the COP is transformed into a dynamic constrained optimisation problem (DCOP), then a DRDE is designed to solve the DCOP for solving the original COP. The key issue is to maintain a feasible population since a feasible population would vanish the difficulty in constraint handling. A deliberate setting of the environment can achieve the maintenance as much as possible. The 'random' in the DRDE means that the scaling factor of the DDE is randomly created in a range to increase search domain so as to enhance the performance of the DRDE. The DRDE is tested by a kit of widely used constraint benchmark problems. The experimental results suggest it outperforms or performs similarly to other state-of-the-art algorithms referred to in this paper.
Online publication date: Sat, 20-Sep-2014
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 Computing Science and Mathematics (IJCSM):
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 email@example.com