百家乐开户-百家乐官网开户-机械百家乐技巧

網(wǎng)站頁(yè)面已加載完成

由于您當(dāng)前的瀏覽器版本過(guò)低,存在安全隱患。建議您盡快更新,以便獲取更好的體驗(yàn)。推薦使用最新版Chrome、Firefox、Opera、Edge

Chrome

Firefox

Opera

Edge

ENG

當(dāng)前位置: 首頁(yè) · 學(xué)術(shù)交流 · 正文

學(xué)術(shù)交流

【學(xué)術(shù)報(bào)告】RMIT University Li Xiaodong教授學(xué)術(shù)報(bào)告會(huì)通知

發(fā)布時(shí)間:2019年11月04日 來(lái)源:航海學(xué)院 點(diǎn)擊數(shù):

報(bào)告主題:Challenges in applying Evolutionary Algorithms to real-world problems

報(bào)告人:LiXiaodong教授

報(bào)告時(shí)間:11月11日10:00

報(bào)告地點(diǎn):航海學(xué)院201會(huì)議室

邀請(qǐng)人:彭星光教授



報(bào)告人簡(jiǎn)介:Xiaodong Li received his B.Sc. degree from Xidian University, Xi'an, China, and Ph.D. degree in information science from University of Otago, Dunedin, New Zealand, respectively. He is a full professor at the School of Science (Computer Science and Software Engineering), RMIT University, Melbourne, Australia. His research interests include evolutionary computation, neural networks, machine learning, complex systems, multiobjective optimization, multimodal optimization (niching), and swarm intelligence. He serves as an Associate Editor of the IEEE Transactions on Evolutionary Computation, Swarm Intelligence (Springer), and International Journal of Swarm Intelligence Research. He is a founding member of IEEE CIS Task Force on Swarm Intelligence, a Vice-chair of IEEE CIS Task Force of Multi-Modal Optimization, and a former Chair of IEEE CIS Task Force on Large Scale Global Optimization. He was the General Chair of SEAL'08, a Program Co-Chair AI'09, a Program Co-Chair for IEEE CEC’2012, a General Chair for ACALCI’2017 and AI’17. He is the recipient of 2013 ACM SIGEVO Impact Award and 2017 IEEE CIS “IEEE Transactions on Evolutionary Computation Outstanding Paper Award”.

報(bào)告內(nèi)容簡(jiǎn)介:Evolutionary algorithms (or broadly speaking, meta-heuristics) represent a family of nature-inspired optimization techniques that have attracted much attention in recent years, due to their general applicability, robustness, and versatility. Many practitioners now realize EAs can offer significant advantages over exact methods, which often have strong assumptions. The adoption of EAs for solving difficult optimization problems is on the increase. However, there are still huge gaps when it comes to applying EAs to optimization problems considering more real-world characteristics. In the big data era, many practical problems are typically high dimensional, highly constrained, and combinatorial in nature. Furthermore, many optimization problems require the involvement of decision makers in the optimization process, rather than leave them out (i.e., human-in-the-loop). In this talk, I will describe some of my own experience in the past few years in dealing with applying evolutionary algorithms to several practical problems of this nature, including minimum cost network flow problems, resource scheduling mining problems, preference modelling for multi-criteria decision making. Since our primary goal is to design effective optimization techniques to solve problems of practical relevance, we deliberately avoided using test functions, typically constructed with too simplistic features far away from real-world scenarios. In this talk, I will focus on presenting the challenges we have encountered when tackling the above optimization problems