Master of Science (MS)
First Advisor's Name
George S. Dulikravich
First Advisor's Committee Title
Second Advisor's Name
Third Advisor's Name
Date of Defense
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.
Chowdhury, Souma, "Modified predator-prey (MPP) algorithm for single-and multi-objective optimization problems" (2008). FIU Electronic Theses and Dissertations. 2352.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).