Home > Academic Announcements > (Mar. 20) State-of-the-art Evolutionary Algorithms for Many Objective Optimization

(Mar. 20) State-of-the-art Evolutionary Algorithms for Many Objective Optimization

Last updated :2019-03-18

Topic: State-of-the-art Evolutionary Algorithms for Many Objective Optimization
Speaker: Professor Gary Gune Yen
(Oklahoma State University, IEEE Fellow/IET Fellow)
Host: Professor WANG Jiahai
Time: 10:00-11:00 am, Wednesday, March 20, 2019
Venue: A101, School of Data and Computer Science, Guangzhou East Campus, SYSU

Evolutionary computation is the study of biologically motivated computational paradigms which exert novel ideas and inspirations from natural evolution and adaptation. The applications of population-based heuristics in solving multiobjective optimization problems have been receiving a growing attention. To search for a family of Pareto optimal solutions based on nature-inspiring problem solving paradigms, Evolutionary Multiobjective Optimization Algorithms have been successfully exploited to solve optimization problems in which the fitness measures and even constraints are uncertain and change over time. When encounter optimization problems with many objectives, nearly all designs perform poorly because of loss of selection pressure in fitness evaluation solely based upon Pareto optimality principle. This talk will first survey recently published literature along this line of research - evolutionary algorithm for many-objective optimization and its real-world applications. In addition, we will devote our attention to address three issues to complete the real-world applications at hand-visualization, performance metrics and multi-criteria decision-making for the many-objective optimization. Visualization of population in a high-dimensional objective space throughout the evolution process presents an attractive feature that could be well exploited in designing many-objective evolutionary algorithms. A performance metric tailored specifically for many-objective optimization is also designed, preventing various artifacts of existing performance metrics violating Pareto optimality principle. A minimum Manhattan distance (MMD) approach to multiple criteria decision making in many-objective optimization problems is proposed.

About the speaker:
Gary G. Yen received the Ph.D. degree in electrical and computer engineering from the University of Notre Dame in 1992. He is currently a Regents Professor in the School of Electrical and Computer Engineering, Oklahoma State University. His research interest includes intelligent control, computational intelligence, evolutionary multiobjective optimization, conditional health monitoring, signal processing and their industrial/defense applications.

Gary was an associate editor of the IEEE Transactions on Neural Networks and IEEE Control Systems Magazine during 1994-1999, and of the IEEE Transactions on Control Systems Technology, IEEE Transactions on Systems, Man and Cybernetics and IFAC Journal on Automatica and Mechatronics during 2000-2010. He is currently serving as an associate editor for the IEEE Transactions on Evolutionary Computation and IEEE Transactions on Cybernetics. Gary served as Vice President for the Technical Activities, IEEE Computational Intelligence Society in 2004-2005 and is the founding editor-in-chief of the IEEE Computational Intelligence Magazine, 2006-2009. He was the President of the IEEE Computational Intelligence Society in 2010-2011 and was elected as a Distinguished Lecturer for the term 2012-2014. He received Regents Distinguished Research Award from OSU in 2009, 2011 Andrew P Sage Best Transactions Paper award from IEEE Systems, Man and Cybernetics Society, 2013 Meritorious Service award from IEEE Computational Intelligence Society and 2014 Lockheed Martin Aeronautics Excellence Teaching award. He is a Fellow of IEEE and IET.