A spatial predator-prey approach to multi-objective optimization: A preliminary study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1498 LNCS, Issue , 1998, Pages 241-249

  Laumanns, Marco ^a   Rudolph, Günter ^a   Schwefel, Hans Paul ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ECOLOGY; EVOLUTIONARY ALGORITHMS; PARETO PRINCIPLE;

EVOLUTIONARY APPROACH; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; OPTIMIZATION CRITERIA; OPTIMIZATION TASK; PARETO-OPTIMAL SETS; PREDATOR-PREY MODELING; SELECTION CRITERIA; STEP-SIZE ADAPTATIONS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 84878544540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056867     Document Type: Conference Paper

References (12)

1. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, Hamburg, 1997.
2. T. Bäck, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionär)' Computation. IOP Publishing and Oxford University Press, New York and Bristol (UK), 1997.
3. J. M. Zurada, R. J. Marks II, and C. J. Robinson, editors. Computational Intelligence: Imitating Life. IEEE Press, Piscataway (NJ), 1994.
4. C. M. Fonseca and P. J. Fleming. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3(1):1-16, 1995.
5. 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.
6. J. Horn. Multicriterion decision making. In T. Back, 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.
7. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York (NY), 1995.
8. U. Feige. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(1):51-54, 1995.
9. U. Feige. A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(4):433-438, 1995.
10. J. L. Palacios. Expected cover times of random walks on symmetric graphs. Journal of Theoretical Probability, 5(3):597-600, 1992.
11. D. Zuckermann. A technique for lower bounding the cover time. SIAM Journal of Discrete Mathematics, 5(1):81-87, 1992.
12. 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.