Please use this identifier to cite or link to this item:
|Title:||Evolving better population distribution and exploration in evolutionary multi-objective optimization|
|Authors:||Tan, K.C. |
Multiple criteria analysis
|Citation:||Tan, K.C., Goh, C.K., Yang, Y.J., Lee, T.H. (2006-06-01). Evolving better population distribution and exploration in evolutionary multi-objective optimization. European Journal of Operational Research 171 (2) : 463-495. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2004.08.038|
|Abstract:||The aim of multi-objective evolutionary optimization is to minimize the distance between the solution set and the true Pareto front, to distribute the solutions evenly and to maximize the spread of solution set. This paper addresses these issues by presenting two features that enhance the optimization ability of multi-objective evolutionary algorithms. The first feature is a variant of the mutation operator that adapts the mutation rate along the evolution process to maintain a balance between the introduction of diversity and local fine-tuning. In addition, this adaptive mutation operator adopts a new approach to strike a compromise between the preservation and disruption of genetic information. The second feature is an enhanced exploration strategy that encourages the exploration towards less populated areas and hence achieves better discovery of gaps in the generated front. The strategy also preserves non-dominated solutions in the evolving population to achieve a good convergence for the optimization. Comparative studies of some well-known diversity operators, mutation operators and multi-objective evolutionary algorithms are performed on different benchmark problems, which illustrate the effectiveness and efficiency of the proposed features. © 2004 Elsevier B.V. All rights reserved.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Dec 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.