同济大学嵌入式系统与服务计算教育部重点实验室

[存为首页] [加入收藏]  

欢迎访问同济大学嵌入式系统与服务计算教育部重点实验室

 公元2017年11月19日[星期日]

总访问量:287821    

■首 页 ■实验室概况 ■科研平台 ■研究方向 ■科研队伍 ■科研项目 ■科研成果 ■开放课题 ■人才培养 ■文件下载
当前位置:主页-学术活动-“智信讲坛”(第九十七)期学术报告

“智信讲坛”(第九十七)期学术报告

浏览次数:173

【保护视力背景色: 杏仁黄 秋叶褐 胭脂红 芥末绿 天蓝 雪青 灰 银河白(默认色)】 【字色: 绿 粉红 深蓝】 【字体:8 7 6 5 4 3 2 1


  题目:Many-Objective Evolutionary Algorithms- Visualization and decision-Making
  
  报告人:Gary G. Yen
  
  时间: 2017年5月22日上午10:30-:12:00am
  
  地点: 403会议室
  
  邀请人: 黄德双 教授
  
  报告人简介:Gary G. Yen received the Ph.D. degree in electrical and computer engineerng 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 is 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. Currently he serves as the chair of IEEE/CIS Fellow Committee and General Co-Chair of 2016 IEEE World Congress on Computational Intelligence to be held in Vancouver, Canada. He is a Fellow of IEEE and IET。
  
  内容提要:Evolutionary computation is the study of biologically motivated computational paradigms which exert novel ideas and inspiration 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 changed over time.
  
  When encounter optimization problems with many objectives, nearly all designs performs poorly because of loss of selection pressure in fitness evaluation solely based upon Pareto optimality principle. In addition to various Many-Objective Evolutionary Algorithms proposed in the last few years, this talk will be devoted 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-dimensional1 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. This procedure is equivalent to the knee selection described by a divide and conquer approach that involves iterations of pairwise comparisons.
  
  欢迎各位老师同学踊跃参加!
  
  
  
 

发布日期:2017-05-18

本篇已是该组第一篇   

本篇已是该组最后一篇