Constrained test problems for multi-objective evolutionary optimization

253Citations
Citations of this article
93Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Over the past few years, researchers have developed a number of multi-objective evolutionary algorithms (MOEAs). Although most studies concentrated on solving unconstrained optimization problems, there exists a few studies where MOEAs have been extended to solve constrained optimization problems. As the constraint handling MOEAs gets popular, there is a need for developing test problems which can evaluate the algorithms well. In this paper, we review a number of test problems used in the literature and then suggest a set of tunable test problems for constraint handling. Finally, NSGA-II with an innovative constraint handling strategy is compared with a couple of existing algorithms in solving some of the test problems. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Deb, K., Pratap, A., & Meyarivan, T. (2001). Constrained test problems for multi-objective evolutionary optimization. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1993, 284–298. https://doi.org/10.1007/3-540-44719-9_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free