Skip to main content
Article thumbnail
Location of Repository

Modified predator-prey (MPP) algorithm for single-and multi-objective optimization problems

By Souma Chowdhury


The aim of this work is to develop an algorithm that can solve multidisciplinary design optimization problems. In predator-prey algorithm, a relatively small number of predators and a much larger number of prey are randomly placed on a two dimensional lattice with connected ends. 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 o f constraint violations serves as an additional objective. Modifications of the basic predator-prey algorithm have been implemented in this study regarding the selection procedure, apparent movement of the predators, mutation strategy, dynamics of the Pareto convergence, etc. Further modifications have been made making the algorithm capable of handling equality and inequality constraints. The final modified algorithm is tested on standard constrained/unconstrained, single and multi-objective optimization problems

Topics: Mechanical Engineering
Publisher: FIU Digital Commons
Year: 2008
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.