 |
    |
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
Tadahiko Murata1, Shiori Kaige2, and Hisao Ishibuchi2
1Department of Informatics,
Kansai University
2-1-1 Ryozenji-cho,
Takatsuki, Osaka 569-1095, Japan
murata@res.kutc.kansai-u.ac.jp,
http: www.res.kutc.kansai-u.ac.jp/~murata/
2Department of Industrial Engineering,
Osaka Prefecture University
1-1 Gakuen-cho, Sakai,
Osaka 599-8531, Japan
{hisaoi,shior}@ie.osakafu-u.ac.jp
http://www.ie.osakafu-u.ac.jp/~hisaoi/ci_lab_e/
Abstract. In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation are usually employed in a local search (LS) for multiobjective optimization. One is to replace a current solution with a solution which dominates it. The other is to replace the solution with a solution which is not dominated by it. The movable area in the LS with the first rule is very small when the number of objectives is large. On the other hand, it is too huge to move efficiently with the latter. We generalize these extreme rules by counting the number of improved objectives in a candidate solution for LS. We propose a LS with the generalized replacement rule for existing EMO algorithms. Its effectiveness is shown on knapsack problems with two, three, and four objectives.
LNCS 2723, p. 1234 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003