2009Unpublished venueRequires access

A hybrid evolutionary algorithm for multiobjective optimization

Chang Wook Ahn, Hyun-Tae Kim, Ye-Hoon Kim, Jinung An

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Evolutionary algorithm, Mathematical optimization, Multi-objective optimization, Mutation, Set (abstract data type), Computer science, Evolutionary computation, Optimization problem

Related papers

Back to paper searchBrowse research topicsOriginal source
A hybrid evolutionary algorithm for multiobjective optimization — Research Paper | ScholarLens