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

Abstract

OF THE THESIS MODIFIED PREDATOR-PREY (MPP) ALGORITHM FOR SINGLEAND MULTI­ OBJECTIVE OPTIMIZATION PROBLEMS by Souma Chowdhury Florida International University, 2008 Miami, Florida Professor George S. Dulikravich, Major Professor 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 o f the basic predator-prey algorithm have been implemented in this study regarding the selection procedure, apparent movement o f the predators, mutation strategy, dynamics o f the Pareto convergence, etc. Further modifications have been made making the algorithm capable o f handling equality and inequality constraints. The final modified algorithm is tested on standard constrained/unconstrained, single and multi­ objective optimization problems.