报告地点：信息楼自动化学院310报告厅

报 告 人：杨圣祥，英国德蒙福特大学教授和计算智能研究中心主任

（一）

报告时间：4月8日（周日）8:30

报告题目：Evolutionary Computation for Dynamic Optimization Problems

内容简介：Evolutionary Computation (EC) encapsulates a class of stochastic ptimization algorithms, which are inspired by principles from natural and biological evolution. EC has been widely used for ptimization problems in many fields. Traditionally, EC methods have been applied for solving static problems. However, many real world problems are dynamic ptimization problems (DOPs), which are subject to changes over time due to many factors. DOPs have attracted a growing interest from the EC community in recent years due to the importance in the real-world applications of EC. This talk will first briefly introduce the concept of EC and DOPs, then review the main approaches developed to enhance EC methods for DOPs, and describe several detailed approaches developed for EC methods for DOPs. Finally, some conclusions will be made based on the work presented and the future work on EC for DOPs will be briefly discussed.

（二）

报告时间：4月8日（周日）14:30

报告题目：Evolutionary Computation for Multi-objective Optimization

内容简介：Multi-objective optimization aims to optimize usually conflicting two or more objectives simultaneously. Evolutionary Computation (EC) has been successfully applied to solve multi-objective optimization problems (MOPs) for several decades with promising results. This talk will first introduce the concepts relevant to MOPs and EC for MOPs, then briefly present the performance measures and test problems used for studying EC for MOPs, and describe main approaches of designing EC methods for solving MOPs, including some detailed EC methods for MOPs. Finally, some future work on EC for MOPs will be briefly discussed.

（三）

报告时间：4月9日（周一）8:30

报告题目：Evolutionary Computation for Many-objective Optimization

内容简介：Many-objective optimization problems (MaOPs) are multi-objective optimization problems (MOPs) that have four or more conflicting objectives to be optimized simultaneously. MaOPs are very challenging to solve. In recent years, studying evolutionary computation (EC) for solving MaOPs has become a very hot topic in the EC community with some promising results. This talk will first introduce the concepts to MaOPs, then describe the main approaches of designing EC methods for solving MaOPs and present some recently developed EC methods for solving MaOPs. Finally, some conclusions on EC for MaOPs will be briefly made.

报告人简介：杨圣祥教授，1999年获东北大学博士学位。1999-2012年，分别在英国King's College London（伦敦国王学院），University of Leicester（莱斯特大学）和 Brunel University（布鲁内尔大学）工作。现任英国De Montfort University（德蒙福特大学）计算机科学与信息学院教授和计算智能研究中心主任，湖南省“芙蓉学者计划”和北京市第十二批“海聚工程”入选专家。杨教授长期从事计算智能理论、方法及应用研究，在计算智能方法、进化计算求解动态优化问题、进化计算求解多目标优化问题、智能网络优化等方面的研究做出了突出贡献，其研究工作得到英国工程和物理科学基金会、英国皇家工程学会、英国皇家学会、欧盟以及工业界的大力资助，先后承担了20余项科研基金项目，总金额达200万英镑。出版英文编著2部，编辑国际会议论文集7部, 发表论文250多篇, 其中SCI期刊论文80余篇。杨教授应邀担任10种国际刊物的副主编或编委，担任国际大会程序委员会主席和分会主席40余次和国际会议程序委员会委员100多次，做国际会议大会报告或专题报告10次。