Mutation strategies toward Pareto front for multi-objective differential evolution algorithm Online publication date: Tue, 17-Jun-2014
by Warisa Wisittipanich; Voratas Kachitvichyanukul
International Journal of Operational Research (IJOR), Vol. 19, No. 3, 2014
Abstract: This paper presents a multi-objective differential evolution algorithm, called MODE, to search for a set of non-dominated solutions on the Pareto front. During the iterative search process, the non-dominated solutions found are stored as the 'Elite group' of solutions. The study focuses on utilising the solutions in the Elite group to guide the movement of the search. Several potential mutation strategies in MODE framework are proposed as the movement guidance in order to obtain the high-quality front. Each mutation strategy possesses distinct search behaviour which directs a vector in the DE population in different ways with the purpose of reaching the Pareto optimal front. The performance of the proposed algorithm is evaluated on a set of well-known benchmark problems and compared with results from other existing approaches. The experimental results demonstrate that the proposed MODE algorithm is a highly competitive approach for solving multi-objective optimisation problems.
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 Operational Research (IJOR):
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