A decomposition-based hybrid multiobjective evolutionary algorithm with dynamic resource allocation

Wali Khan Mashwani

doi:10.1016/j.asoc.2012.03.067

Return

A decomposition-based hybrid multiobjective evolutionary algorithm with dynamic resource allocation

2012-09-01

PRE

Wali Khan Mashwani *

Abdellah Salhi

DOI：10.1016/j.asoc.2012.03.067

Original

Original request for help

Save

Abstract

En 中文

Different crossover operators suit different problems. It is, therefore, potentially problematic to chose the ideal crossover operator in an evolutionary optimization scheme. Using multiple crossover operators could be an effective way to address this issue. This paper reports on the implementation of this idea, i.e. the use of two crossover operators in a decomposition-based multi-objective evolutionary algorithm, but not simultaneously. After each cycle, the operator which has helped produce the better offspring is rewarded. This means that the overall algorithm uses a dynamic resource allocation to reward the better of the crossover operators in the optimization process. The operators used are the Simplex Crossover operator (SPX) and the Center of Mass Crossover operator (CMX). We report experimental results that show that this innovative use of two crossover operators improves the algorithm performance on standard test problems. Results on the sensitivity of the suggested algorithm to key parameters such as population size, neighborhood size and maximum number of solutions to be altered for a given subproblem in the the decomposition process are also included. (C) 2012 Elsevier B.V. All rights reserved.

Keywords:

Multi-objective optimization

Pareto optimality

Decomposition

Crossover

Resource allocation

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.