Ant Colony Optimization: Its Foraging Behavior in Optimization
工工系博士班專題演講公告
Ant Colony Optimization: Its Foraging Behavior in Optimization
主講者:梁韵嘉教授 (元智大學)
主持人:吳建瑋教授、廖崇碩教授
日期:2013/11/14 (四)
時間:14:20~16:20
地點:清華大學 工程一館 R901
摘要:
Ant Colony Optimization (ACO), inspired by the behavior of real ants, is considered
one of the most successful algorithms in Swarm Intelligence (SI).
Early applications of ACO have solved combinatorial optimization problems such as
Traveling Salesman Problem (TSP), Quadratic Assignment Problem (QAP),
and Vehicle Routing Problem (VRP). Furthermore, recent applications have
introduced ACO to the problems with continuous domain. In this seminar,
Dr. Liang will share his research experience of ACO on both continuous and
combinatorial problems. The application examples include the orienteering
problem, redundancy allocation problem, on-line scheduling problem, and curve fitting problem.
~敬邀參加~