Abstract
This paper proposes a real-coded predator-prey GA for multiobjective optimization (RCPPGA). The model takes its inspiration from the spatial predator-prey dynamics observed in nature. RCPPGA differs itself from previous similar work by placing a specific emphasis on introducing a dynamic spatial structure to the predator-prey population. RCPPGA allows dynamic changes of the prey population size depending on available space and employs a BLX-α crossover operator that encourages a more self-adaptive search. Experiments using two different fitness assignment methods have been carried out, and the results are compared with previous related work. Although RCPPGA does not employ elitism explicitly (such as using an external archive), it has been demonstrated that given a sufficiently large lattice size, RCPPGA can consistently produce and maintain a diverse distribution of nondominated optimal solutions along the Pareto-optimal front even after many generations.
Keywords
- Pareto Front
- Multiobjective Optimization
- Lattice Size
- Prey Population
- Multiobjective Optimization Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester, UK (2001)
Zitzler, E. and Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach, IEEE Transactions on Evolutionary Computation, 3(4): 257–271, (1999)
Hajela, P. and Lin, C.-Y.: Genetic search strategies in multicriterion optimal design, Structural Optimization, vol. 4. New York: Springer, (1992) 99–107
Horn, J. and Nafpliotis, N.: Multiobjective optimization using niched pareto genetic algorithm, IllGAL Report 93005, Illinois Genetic Algorithm Lab., Univ. Illinois, Urbana-Champaign (1993)
Laumanns, M., Rudolph, G. and Schwefel, H. P.: A Spatial Predator-Prey Approach to Multi-Objective Optimization: A Preliminary Study, In: Eiben, A. E., Schoenauer, M. and Schwefel, H.P (eds.): Proceedings of the Parallel Problem Solving From Nature — PPSN V, Springer-Verlag, Amsterdam, Holland, (1998) 241–249
Manderick, B. and Spiessens, P.: Fine-grained parallel genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann (1989) 428–433
Cantu-Paz, E.: A Survey of Parallel Genetic Algorithms. Technical Report IlliGAL 97003, University of Illinois at Urbana-Champaign (1997)
Kirley, M., Li, X., and Green, D.: Investigation of a cellular genetic algorithm that mimics landscape ecology. In: McKay, R., et al. (eds.): Simulated Evolution and Learning — SEAL98, volume 1585 Lecture Notes in Artificial Intelligence, Springer-Verlag (1998) 90–97
Kirley, M. A.: A Cellular Genetic Algorithm with Disturbances: Optimisation Using Dynamic Spatial Interactions. In: Journal of Heuristics. 8(3):321–342 (2002)
Li, X. and Kirley, M.: The Effects of Varying Population Density in a Fine-grained Parallel Genetic Algorithm. In: The Proceedings of the 2002 Congress on Evolutionary Computation (CEC’02). Vol: 2, 1709–1714 (2002)
Li, X. and Sutherland, S.: A Cellular Genetic Algorithm Simulating Predator-Prey Interactions. In: Proceeding of the 4th Asia-Pacific Conference on Simulated Evolution And Learning (SEAL’02), edited by Wang, L., Tan, K.C., Furuhashi, T., Kim, J-H and Yao, X., (2002) 76–80
Smith, R.L. and Smith, T.M.: Elements of Ecology — fourth edition, The Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA 94025 (1998)
Wright, A.: Genetic Algorithms for Real Parameter Optimization. In: Rawlin, G.J.E. (eds.): Foundations of Genetic Algorithms 1. Morgan Kaufmann, San Mateo (1991) 205–218
Eshelman, L. J. and Schaffer, J.: Realcoded genetic algorithms and interval-schemata. In: Foundation of Genetic Algorithms. (1991) 187–202
Deb, K. and Beyer, H.: Self-Adaptive Genetic Algorithms with Simulated Binary Crossover, Evolutionary Computation 9(2): 197–221, MIT Press (2001)
Knowles, J.D. and Corne, D.W.: Approximating the nondonimated frond using the Pareto Archived Evolution Strategy. Evolutionary Computation, 7(3): 1–26 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X. (2003). A Real-Coded Predator-Prey Genetic Algorithm for Multiobjective Optimization. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive