University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Connectedness, regularity and the success of local search in evolutionary multi-objective optimization

Jin, Y and Sendhoff, B (2003) Connectedness, regularity and the success of local search in evolutionary multi-objective optimization

Full text not available from this repository.

Abstract

Local search techniques have proved to be very efficient in evolutionary multi-objective optimization (MOO). However, the reasons behind the success of local search in MOO have not yet been well discussed. This paper attempts to investigate empirically the main factors that may have contributed significantly to the success of local search in MOO. It is found that for many widely used test problems, the Pareto optimal solutions are connected both in objective space and parameter space. Besides, the Pareto-optimal solutions often distribute so regularly in parameter space that they can be defined by piecewise linear functions. By constructing an approximate model using the solutions produced by an optimizer, the quality of the non-dominated solution set can be further improved. The evolutionary dynamic weighted aggregation (EDWA) method has been adopted as a local search technique in finding Pareto-optimal solutions. Its effectiveness for MOO is demonstrated on a number of two or three objective optimization problems. © 2003 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
NameEmailORCID
Jin, Yyaochu.jin@surrey.ac.ukUNSPECIFIED
Sendhoff, BUNSPECIFIEDUNSPECIFIED
Date : 1 January 2003
Identification Number : https://doi.org/10.1109/CEC.2003.1299907
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:17
Last Modified : 17 May 2017 15:10
URI: http://epubs.surrey.ac.uk/id/eprint/838619

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800