蚁群算法在组合优化中的应用  

Application of ant colony algorithm in combination and optimization

作　　者：邓玉芬[1] 向凤红[1] 

机构地区：[1]昆明理工大学信息工程与自动化学院,昆明650051

出　　处：《电子测量技术》2007年第1期32-35,共4页Electronic Measurement Technology

摘　　要：本文介绍了崭新的求解复杂优化问题的启发式算法—蚁群算法以及它的基本原理。该算法是通过模拟蚁群搜索食物的过程,达到求解此类问题的目的。它具有智能搜索、全局优化、稳健性强、分布式计算、易与其他方法结合等优点。文章还介绍了该算法在静态组合优化,如旅行商、二次分配、车间任务调度、车辆路线、图着色、有序排列,以及动态组合优化中的应用。文章最后展望了蚁群算法所具有的广阔应用前景。A new heuristic algorithm-ant colony optimization and its basical theory are introduced in this article to solve the complicated and optimized questions. This method simulates the course of ant searching food to solve this kind of questions. It has these merits such as intelligent searching, holistic optimizing, strong solidity, distributed calculate and easily to combine with other methods. Then the article introduces its application in static combination and optimization, such as TSP, OAP, JSP, VRP, GCP, SOP, and dynamic combination and optimization. Finally, the article makes out an expection that ant colony algorithm has a bright applied future.

关 键 词：蚁群算法 组合优化 优化 

分 类 号：TD722[矿业工程—矿井通风与安全]