DocumentCode
3006037
Title
A Tunable Constrained Test Problems Generator for Multi-objective Optimization
Author
Peng Cheng
Author_Institution
Coll. of Comput. & Inf. Sci., SouthWest Univ., Chongqing
fYear
2008
fDate
25-26 Sept. 2008
Firstpage
96
Lastpage
100
Abstract
Multi-objective optimization problems (MOPs) in real world are often constrained optimization problems. So test problems to evaluate multi-objective optimization evolutionary algorithms (MOEAs) should have some constraints in order to simulate real-world problems. In this paper, a well understood and tunable constrained test problems generator is suggested. By setting parameters in the constraint function, test problems with various complexity and Pareto-optimal front geometries can be created. Six constrained MOPs are developed and explained in figures so as to account for parameters in the constraint function. Furthermore, NSGA-II with an constrained handling strategy are used to solve the test problems. Experiments results show test problem can greatly increase difficulties in searching Pareto-optimal solutions, and they are effective tools to evaluate MOEAs in constraints handling.
Keywords
Pareto optimisation; constraint handling; constraint theory; evolutionary computation; MOEA; MOP; NSGA-II; Pareto-optimal solutions; constrained optimization problems; constraints handling; multi objective optimization evolutionary algorithms; multi objective optimization problems; tunable constrained test problems generator; Benchmark testing; Character generation; Computational modeling; Constraint optimization; Educational institutions; Evolutionary computation; Genetics; Geometry; Information science; Strips; Constrained test problems; Multi-objective optimization; Pareto-optimal;
fLanguage
English
Publisher
ieee
Conference_Titel
Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on
Conference_Location
Hubei
Print_ISBN
978-0-7695-3334-6
Type
conf
DOI
10.1109/WGEC.2008.105
Filename
4637403
Link To Document