196
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, APRIL 2002
TABLE VI
L
OWER AND
U
PPER
B
OUNDS OF THE
O
BJECTIVE
F
UNCTION
V
ALUES
O
BSERVED IN THE
O
BTAINED
N
ONDOMINATED
S
OLUTIONS
Fig. 21.
Upper diagonal plots are for NSGA-II and lower diagonal plots are for Ray–Tai–Seow’s algorithm. Compare
(i; j) plot (Ray–Tai–Seow’s algorithm
with
i > j) with (j; i) plot (NSGA-II). Label and ranges used for each axis are shown in the diagonal boxes.
research in single-objective EA studies, this paper shows
that highly epistatic problems may also cause difficulties to
MOEAs. More importantly, researchers in the field should
consider such epistatic problems for testing a newly developed
algorithm for multiobjective optimization.
We have also proposed a simple extension to the definition
of dominance for constrained multiobjective optimization. Al-
though this new definition can be used with any other MOEAs,
the real-coded NSGA-II with this definition has been shown
to solve four different problems much better than another re-
cently-proposed constraint-handling approach.
With the properties of a fast nondominated sorting procedure,
an elitist strategy, a parameterless approach and a simple yet
efficient constraint-handling method, NSGA-II, should find in-
creasing attention and applications in the near future.
R
EFERENCES
[1] K. Deb,
Multiobjective Optimization Using Evolutionary Algo-
rithms.
Chichester, U.K.: Wiley, 2001.
[2]
, “An efficient constraint-handling method for genetic algorithms,”
Chia sẻ với bạn bè của bạn: