首页 | 本学科首页   官方微博 | 高级检索  
     

动态蚁群算法在带时间窗车辆路径问题中的应用
引用本文:刘云忠,宣慧玉. 动态蚁群算法在带时间窗车辆路径问题中的应用[J]. 中国工程科学, 2005, 7(12): 35-40
作者姓名:刘云忠  宣慧玉
作者单位:西安交通大学管理学院,西安,710049
摘    要:蚁群算法是近年来新出现的一种随机型搜索寻优算法。自从在旅行商等著名问题中得到富有成效的应用之后,已引起人们越来越多的关注和重视。将这种新型的生物优化思想扩展到物流管理中的带时间窗车辆路径问题,设计了一种动态蚁群算法,从数值计算上探索了这种新型蚁群算法的优化能力,获得了满意的效果。

关 键 词:蚁群算法;带时间窗车辆路径问题;物流管理;动态
文章编号:1009-1742(2005)12-0035-06
收稿时间:2004-01-08
修稿时间:2004-10-29

Application Research on Vehicle Routing Problem With Time Windows Based on Dynamic Ant Algorithm
liuyunzhong and xuanhuiyu. Application Research on Vehicle Routing Problem With Time Windows Based on Dynamic Ant Algorithm[J]. Engineering Science, 2005, 7(12): 35-40
Authors:liuyunzhong and xuanhuiyu
Abstract:Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years. It has been paid much attention to since the successful application in the famous traveling salesman problem. This paper further extends the idea of this new biological optimization strategy to vehicle routing problem with time windows in logistic management and designs a new kind of dynamic ant algorithm. The ability of optimization of this new ant algorithm is tested through numerical computation which gives encouraging results.
Keywords:ant algorithm   vehicle routing problem with time windows   logistic management   dynamic
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《中国工程科学》浏览原始摘要信息
点击此处可从《中国工程科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号