Adaptive diversity maintenance and convergence guarantee in multiobjective evolutionary algorithms

Huidong JIN, Man Leung WONG

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

15 Citations (Scopus)

Abstract

The issue of obtaining a well-converged and well-distributed set of Pareto optimal solutions efficiently and automatically is crucial in multiobjective evolutionary algorithms (MOEAs). Many studies have proposed different evolutionary algorithms that can progress towards Pareto optimal sets with a wide-spread distribution of solutions. However, most mathematically convergent MOEAs desire certain prior knowledge about the objective space in order to efficiently maintain widespread solutions. We propose, based on our novel E-dominance concept, an adaptive rectangle archiving (ARA) strategy that overcomes this important problem. The MOEA with this archiving technique provably converges to well-distributed Pareto optimal solutions without prior knowledge. ARA complements the existing archiving techniques, and is useful to both researchers and practitioners.
Original languageEnglish
Title of host publication2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings
PublisherIEEE Computer Society
Pages2498-2505
Number of pages8
Volume4
DOIs
Publication statusPublished - 8 Dec 2003

Bibliographical note

Paper presented at the Congress on Evolutionary Computation (CEC), Dec 08-12, 2003, Canberra, Australia.

Fingerprint Dive into the research topics of 'Adaptive diversity maintenance and convergence guarantee in multiobjective evolutionary algorithms'. Together they form a unique fingerprint.

  • Cite this

    JIN, H., & WONG, M. L. (2003). Adaptive diversity maintenance and convergence guarantee in multiobjective evolutionary algorithms. In 2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings (Vol. 4, pp. 2498-2505). IEEE Computer Society. https://doi.org/10.1109/CEC.2003.1299402