Ant Colony Optimization: Its Foraging Behavior in Optimization
工工系博士班專題演講公告
Special Topics I
Ant Colony Optimization: Its Foraging Behavior in Optimization
Speaker:Yun-Chia , Liang Professor (Yuan Ze University)
Host:Chien-Wei Wu Professor、Chung-Shou Liao Professor
Date:2013/11/14
Time:14:20~16:20
Location:Engineering Building I , R901
Abstract:
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.
~Welcome~