DocumentCode
2725736
Title
Handling constraints in robust multi-objective optimization
Author
Gupta, Himanshu ; Deb, Kalyanmoy
Author_Institution
Kanpur Genetic Algorithms Lab., Indian Inst. of Technol., Kanpur
Volume
1
fYear
2005
fDate
5-5 Sept. 2005
Firstpage
25
Abstract
Robust multi-objective optimization has emerged as an active research. A recent study proposed two different definitions of robust solutions in the context of multi-objective optimization. In this paper, we extend the concepts for finding robust solutions in the presence of active constraints. The meaning of robust solutions for constrained problems is demonstrated by suggesting three test problems and simulating an evolutionary multi-objective optimization method using the two definitions of robustness. The inclusion of constraint handling strategies makes the multi-objective robust optimization procedure more pragmatic and the procedure is now ready to be applied to real-world problems
Keywords
Pareto optimisation; constraint handling; evolutionary computation; search problems; constraint handling; evolutionary multiobjective robust optimization method; Constraint optimization; Degradation; Genetic algorithms; Laboratories; Mathematical model; Noise robustness; Optimization methods; Pareto optimization; Testing; Uniform resource locators;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Conference_Location
Edinburgh, Scotland
Print_ISBN
0-7803-9363-5
Type
conf
DOI
10.1109/CEC.2005.1554663
Filename
1554663
Link To Document