Please use this identifier to cite or link to this item:
https://doi.org/10.1023/A:1022863019997
Title: | A tabu-based exploratory evolutionary algorithm for multiobjective optimization | Authors: | Tan, K.C. Khor, E.F. Lee, T.H. Yang, Y.J. |
Keywords: | Evolutionairy algorithms Multiobjective Optimization |
Issue Date: | May-2003 | Citation: | Tan, K.C., Khor, E.F., Lee, T.H., Yang, Y.J. (2003-05). A tabu-based exploratory evolutionary algorithm for multiobjective optimization. Artificial Intelligence Review 19 (3) : 231-260+191. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1022863019997 | Abstract: | This paper presents an exploratory multiobjective evolutionary algorithm (EMOEA) that integrates the features of tabu search and evolutionary algorithm for multiobjective (MO) optimization. The method incorporates the tabu restriction in individual examination and preservation in order to maintain the search diversity in evolutionary MO optimization, which subsequently helps to prevent the search from trapping in local optima as well as to promote the evolution towards the global trade-offs concurrently. In addition, a new lateral interference is presented in the paper to distribute nondominated individuals along the discovered Pareto-front uniformly. Unlike many niching or sharing methods, the lateral interference can be performed without the need of parameter settings and can be flexibly applied in either the parameter or objective domain. The features of the proposed algorithm are examined based upon three benchmark problems. Experimental results show that EMOEA performs well in searching and distributing nondominated solutions along the trade-offs uniformly, and offers a competitive behavior to escape from local optima in a noisy environment. | Source Title: | Artificial Intelligence Review | URI: | http://scholarbank.nus.edu.sg/handle/10635/54833 | ISSN: | 02692821 | DOI: | 10.1023/A:1022863019997 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.