Seminar by Prof. Kalyanmoy Deb
An Overview of Multi-Objective Evolutionary Algorithms
Prof. Kalyanmoy Deb
Kanpur Genetics Algorithms Laboratory (KanGAL)
Department of Mechanical Engineering
Indian Institute of Technology Kanpur
Date: Monday, October 01, 2001
Time: 03:30 PM
Venue: CC-217
Abstract
Evolutionary algorithms (EAs) mimick nature's evolutionary principles to solve search and optimization problems. The basic difference between EAs and classical search and optimization methods is that EAs use a population of solutions, instead of a single solution. Since an iteration of EAs stores and processes multiple solutions, it is convenient to use EAs to find and store multiple optimal solutions in one single simulation run. This simple fact has motivated a number of evolutionary algorithmists to modify the standard EA procedures to suit to solve multi-objective optimization problems, not only to find solutions close to the Pareto-optimal front but also to maintain a wide diversity among them. This makes the EA approach unique in handling multi-criterion decision making and multi-objective optimization problems.
In this talk, a number of state-of-the-art multi-objective EAs (MOEAs), which use the domination concept, will be presented. The basic differences between the classical generating methods and MOEAs will be highlighted through test problems and a few engineering case studies.
About the Speaker
Prof. Kalmanmoy Deb is a Professor in Mechanical Engineering Department at IIT Kanpur. He heads the Kanpur Genetics Algorithm Laboratory (KanGAL). He has received numerous awards, including Humboldt Fellowship. He is an associate editor of the IEEE Transactions on Evolutionary Computation Journal. He has authored more than 100 research papers and published two books. He is the most cited Indian researcher in Computer Science.