arrow
Return

A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization

delete2008-08-01
delete64
PRE
AI
M
Min-Rong Chen *
L
Lu, Yong-Zal
DOI:10.1016/j.ejor.2007.05.008delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
Recently, a general-purpose local-search heuristic method called extremal optimization (EO) has been successfully applied to some NP-hard combinatorial optimization problems. This paper presents an investigation on EO with its application in numerical multiobjective optimization and proposes a new novel elitist (1 + lambda) multiobjective algorithm, called multiobjective extremal optimization (MOEO). In order to extend EO to solve the multiobjective optimization problems, the Pareto dominance strategy is introduced to the fitness assignment of the proposed approach. We also present a new hybrid mutation operator that enhances the exploratory capabilities of our algorithm. The proposed approach is validated using five popular benchmark functions. The simulation results indicate that the proposed approach is highly competitive with the state-of-the-art multiobjective evolutionary algorithms. Thus MOEO can be considered a good alternative to solve numerical multiobjective optimization problems. (C) 2007 Elsevier B.V. All rights reserved.
Keywords:
multiple objective programming
metaheuristics
extremal optimization
self-organized criticality

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
8.1W

Organization

Shanghai Jiao Tong University cover
Shanghai Jiao Tong University
Scholars:
1.3W
Papers: 3.9K
Citations: 8.7W
Cited Papers

Cited Papers

errShare
errSave
errShare
errSave
errShare
errSave
errShare
errSave
The effect of void arrays on void linking during ductile fracture
err1988-06-01
err0
PREAI
errP.E. Magnusen; E.M. Dubensky; D.A. Koss
errShare
errSave
researcher View more