|
|||||
|
|
| 混合蚁群算法在有容量约束车辆调度中的研究 | |
| 引用本文： | 张利,刘光年,李立宏,刘征宇,张建军.混合蚁群算法在有容量约束车辆调度中的研究[J].组合机床与自动化加工技术,2007(2):8-11. |
| 作者姓名： | 张利 刘光年 李立宏 刘征宇 张建军 |
| 作者单位： | 1. 合肥工业大学,机械与汽车工程学院,合肥,230009;安全关键工业测控技术教育部工程研究中心,合肥,230009 2. 合肥工业大学,机械与汽车工程学院,合肥,230009 3. 中兴通讯股份有限公司,深圳,518057 |
| 基金项目： | 中兴通讯科研项目;安徽省自然科学基金 |
| 摘 要： | 蚁群算法在解决旅行商等著名问题时得到了富有成效的应用,但当解决大规模问题时,其收敛速度较慢且耗时较长。同样,郭涛算法解决复杂优化问题时取得了良好效果,但会产生大量无为的冗余迭代,求解效率低。文章汲取蚁群算法和郭涛算法的优点,提出混合蚁群算法,以带有容量约束的车辆路径问题,建立了混合蚁群算法数学模型,得到时间效率和求解效率都比较好的一种新的启发式方法。 |
| 关 键 词： | 蚁群算法 旅行商问题 郭涛算法 混合蚁群算法 车辆调度 |
| 文章编号： | 1001-2265（2007）02-0008-04 |
| 修稿时间： | 2006-08-162006-11-20 |
Research on Vehicle Scheduling with Capacity Restraint Based on Mixed Ant Colony Algorithm |
|
| ZHANG Li,LIU Guang-nian,LI Li-hong,LIU Zheng-yu,ZHANG Jian-jun.Research on Vehicle Scheduling with Capacity Restraint Based on Mixed Ant Colony Algorithm[J].Modular Machine Tool & Automatic Manufacturing Technique,2007(2):8-11. | |
| Authors: | ZHANG Li LIU Guang-nian LI Li-hong LIU Zheng-yu ZHANG Jian-jun |
| Affiliation: | 1. School of Machinery and Automobile Engineering, Hefei University of Technology, Hefei 230009, China; 2. ZTE Corporation, Shenzhen 518057, China |
| Abstract: | Ant colony arithmetic has been paid much attention to since the successful application in the famous traveling salesman problem,but when it confronts large-scale problem,converged velocity is relatively slow and much time should be taken.However,Guo's arithmetic works fairly well.When the problem has been settled to a certain extent,a great number of useless redundance iterations come out, therefore,it becomes very inefficient.Directed at these reasons,a mixed Ant colony arithmetic extracting the key features of Ant colony arithmetic and Guo's arithmetic is proposed in this paper.This new algorithm is a new enlightening method,which overcomes the disadvantages of the two algorithms.It is efficient. |
| Keywords: | ant colony algorithm TSP guo's algorithm mixed ant colony algorithm vehicle scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |