OAK

A hybrid evolutionary algorithm for multiobjective optimization

Metadata Downloads
Abstract
This paper presents a hybrid evolutionary algorithm that efficiently solves multiobjective optimization problems. The idea is to bring the strength of adaptive local search (ALS) to bear upon the realm of multiobjective evolutionary optimization. The ALS is developed by harmonizing a weighted fitness policy with a restricted mutation: it applies mutation only to a set of superior individuals in accordance with the weighted fitness values. It economizes search time and efficiently traverses the problem space in the vicinity of the most-likely and least-crowded solutions. Thus, it helps achieve higher proximity and better diversity of nondominated solutions. Empirical results support the effectiveness of the proposed approach. ©2009 IEEE.
Author(s)
Ahn, Chang WookAn, JinungKim, Ye HoonKim, Hyuntae
Issued Date
2009-10
Type
Conference Paper
DOI
10.1109/BICTA.2009.5338162
URI
https://scholar.gist.ac.kr/handle/local/25468
Publisher
IEEE
Citation
2009 4th International Conference on Bio-Inspired Computing: Theories and Applications, pp.19 - 23
Conference Place
CC
Appears in Collections:
Department of AI Convergence > 2. Conference Papers
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.