Abstract
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) uses the predator-prey model from ecology. The prey are the usual individuals of an EA that represent possible solutions to the optimization task. They are placed at vertices of a graph, remain stationary, reproduce, and are chased by predators that traverse the graph. The predators chase the prey only within its current neighborhood and according to one of the optimization criteria. Because there are several predators with different selection criteria, those prey individuals, which perform best with respect to all objectives, are able to produce more descendants than inferior ones. As soon as a vertex for the prey becomes free, it is refilled by descendants from alive parents in the usual way of EA, i.e., by inheriting slightly altered attributes. After a while, the prey concentrate at Pareto-optimal positions. The main objective of this preliminary study is the answer to the question whether the predator-prey approach to multi-objective optimization works at all. The performance of this evolutionary algorithm is examined under several step-size adaptation rules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, Hamburg, 1997.
T. Bäck, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. IOP Publishing and Oxford University Press, New York and Bristol (UK), 1997.
J. M. Zurada, R. J. Marks II, and C. J. Robinson, editors. Computational Intelligence: Imitating Life. IEEE Press, Piscataway (NJ), 1994.
C. M. Fonseca and P. J. Fleming. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3(1):1–16, 1995.
H. Tamaki, H. Kita, and S. Kobayashi. Multi-objective optimization by genetic algorithms: a review. In Proceedings of the 3rd IEEE International Conference on Evolutionary Computation, pages 517–522. IEEE Press, Piscataway (NJ), 1996.
J. Horn. Multicriterion decision making. In T. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages F1.9:1–15. IOP Publishing and Oxford University Press, New York and Bristol (UK), 1997.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York (NY), 1995.
U. Feige. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(1):51–54, 1995.
U. Feige. A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(4):433–438, 1995.
J. L. Palacios. Expected cover times of random walks on symmetric graphs. Journal of Theoretical Probability, 5(3):597–600, 1992.
D. Zuckermann. A technique for lower bounding the cover time. SIAM Journal of Discrete Mathematics, 5(1):81–87, 1992.
G. Rudolph. On a multi-objective evolutionary algorithm and its convergence to the pareto set. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pages 511–516. IEEE Press, Piscataway (NJ), 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laumanns, M., Rudolph, G., Schwefel, HP. (1998). A spatial predator-prey approach to multi-objective optimization: A preliminary study. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056867
Download citation
DOI: https://doi.org/10.1007/BFb0056867
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive