DocumentCode
2695594
Title
MSOPS-II: A general-purpose Many-Objective optimiser
Author
Hughes, Evan J.
Author_Institution
Cranfield Univ., Shrivenham
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
3944
Lastpage
3951
Abstract
Existing evolutionary methods capable of true many-objective optimisation have been limited in their application: for example either initial search directions need to be specified a-priori, or the use of hypervolume limits the search in practice to less than 10 objective dimensions. This paper describes two extensions to the multiple single objective pareto sampling (MSOPS) algorithm. The first provides automatic target vector generation, removing the requirement for initial a-priori designer intervention; and secondly redefines the fitness assignment method to simplify analysis and allow more comprehensive constraint handling. The significant enhancements allow the new MSOPS-II ranking process to be used as part of a general-purpose multi/many objective optimisation algorithm, requiring minimal initial configuration.
Keywords
Pareto optimisation; constraint handling; evolutionary computation; search problems; MSOPS-II; automatic target vector generation; constraint handling; fitness assignment method; many-objective optimisation; multiple single objective pareto sampling; Approximation algorithms; Decision making; Measurement; Optimization methods; Pareto optimization; Sampling methods; Space exploration; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424985
Filename
4424985
Link To Document