Abstract
In predator–prey algorithm, a relatively small number of predators (“lions”) and a much larger number of prey (“antelopes”) are randomly placed on a two dimensional lattice with connected ends representing an unfolded surface of a torus. The predators are partially or completely biased towards one or more objectives, based on which each predator kills the weakest prey in its neighborhood. A stronger prey created through evolution replaces this prey. In case of constrained problems, the sum of constraint violations serves as an additional objective. Modifications of the basic predator–prey algorithm have been implemented in this paper regarding the selection procedure, apparent movement of the predators, and mutation strategy. Further modifications have been made making the algorithm capable of handling multiple equality and inequality constraints. The final modified algorithm was tested on standard linear/nonlinear and constrained/unconstrained single-objective optimization problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Cavicchio DJ (1970) Adaptive search using simulated evolution. PhD thesis. Ann Arbor, MI: University of Michigan
Chowdhury S, Dulikravich GS, Moral RJ (2009) Modified predator–prey (MPP) algorithm for constrained multi-objective optimization. In: Burczynski T (ed) EUROGEN 2009, Cracow, Poland
Chowdhury S, Dulikravich GS, Moral RJ (2010) Modified predator–prey algorithm for constrained and unconstrained multi-objective optimization problems. Int J Math Model Numer Optim 1(1):1–24
Coello Coello C (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11–12):1245–1287
Colaço MJ, Dulikravich GS, Orlande HRB, Martin TJ (2005) Hybrid optimization with automatic switching among optimization algorithms. In: Annicchiarico W, Périaux J, Cerrolaza M, Winter G (eds) A chapter in evolutionary algorithms and intelligent tools in engineering optimization. WIT, CIMNE, Barcelona, pp 92–118
Colaco MJ, Dulikravich GS, Sahoo D (2008) A response surface method-based hybrid optimizer. Inverse Probl Sci Eng 16(6):717–741
Cuco APC, Neto AJS, Velho HFC, de Sousa FLD (2008) Solution of an inverse adsorption problem with an epidemic genetic algorithm and the generalized extremal optimization algorithm. Inverse Probl Sci Eng 16(8):901–914
Deb K (2002) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester
Deb K, Agarwal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Proceedings of the parallel problem solving from nature VI conference, pp 849–858
Dejong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. PhD thesis. Ann Arbor, MI: University of Michigan. Dissertation Abstracts International 36(10), 5140B (University Microfilms No. 76–9381)
Dulikravich GS, Martin TJ, Dennis BH, Foster NF (1999) Multidisciplinary hybrid constrained GA optimization. In: Miettinen K, Makela MM, Neittaanmaki P, Periaux J (eds) A chapter in EUROGEN’99- evolutionary algorithms in engineering and computer science: recent advances and industrial applications. Wiley, Jyvaskyla, pp 233–259
Goldberg DE, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the first international conference on genetic algorithms and their applications, pp 41–49
Grimme C, Schmitt K (2006) Inside a predator–prey model for multiobjective optimization—a second study. In: Proc. genetic and evolutionary computation conf. GECCO 2006. Seattle WA. ACM, New York, pp 707–714
Hock W, Schittkowski K (1981) Test examples for nonlinear programming codes. Lecture notes in economics and mathematical systems, vol 187. Springer, Berlin
Laumanns M, Rudolph G, Schwefel HP (1998) A spatial predator–prey approach to multi-objective optimization: a preliminary study. Lect Notes Comput Sci 1498:241–249
Li X (2003) A real-coded predator–prey genetic algorithm for multi-objective optimization. Lect Notes Comput Sci 2632:69
Martin TJ, Dulikravich GS (2002) Analysis and multidisciplinary optimization of internal coolant networks in turbine blades. AIAA J Propuls Power 18(4):896–906
Michalewicz J (1992) Genetic algorithms + data structures = evolutionary programs. Berlin, Springer-Verlag
Moral MJ, Dulikravich GS (2008) Multi-objective hybrid evolutionary optimization utilizing automatic algorithm switching. AIAA J 46(3):673–700
Schittkowski K (1987) More test examples for nonlinear programming. Lecture notes in economics and mathematical systems, vol 282. Springer, New York
Silva A, Neves E, Costa E (2002) An empirical comparison of particle swarm and predator–prey optimization. Lect Notes Comput Sci 2464:103–110
Sobol IM (1976) Uniformly distributed sequences with an additional uniform property. USSR Comput Math Math Phys 16:236–242
Venter G, Haftka RT (2009) Constrained particle swarm optimization using a bi-objective formulation. Struct Multidisc Optim. doi:10.1007/s00158-009-0380-6
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper has not been published nor submitted for publication anywhere else besides Structural and Multidisciplinary Optimization.
Rights and permissions
About this article
Cite this article
Chowdhury, S., Dulikravich, G.S. Improvements to single-objective constrained predator–prey evolutionary optimization algorithm. Struct Multidisc Optim 41, 541–554 (2010). https://doi.org/10.1007/s00158-009-0433-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-009-0433-x