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

带时间窗车辆路径问题的混合改进型蚂蚁算法
引用本文:崔雪丽,朱道立.带时间窗车辆路径问题的混合改进型蚂蚁算法[J].计算机工程与应用,2009,45(4):16-19.
作者姓名:崔雪丽  朱道立
作者单位:1. 苏州科技学院,经济与管理学院,江苏,苏州,215009
2. 复旦大学,管理学院,上海,200433
基金项目:国家自然科学基金,中国博士后科学基金 
摘    要:带时间窗车辆路径问题(VRPTW)是VRP的一种重要扩展类型,在蚂蚁算法思想基础上,设计用于求解该问题的混合改进型算法并求解Solomon标准数据库中的大量实例。经过大量数据测试并与其他启发式算法所得结果进行比较,获得了较好的效果。

关 键 词:带时间窗车辆路径问题  混合蚂蚁算法  转移概率修正
收稿时间:2008-5-13
修稿时间:2008-11-4  

Hybrid improved ant algorithm for vehicle routing problem with time windows
CUI Xue-li,ZHU Dao-li.Hybrid improved ant algorithm for vehicle routing problem with time windows[J].Computer Engineering and Applications,2009,45(4):16-19.
Authors:CUI Xue-li  ZHU Dao-li
Affiliation:CUI Xue-li1,ZHU Dao-li2 1.College of Economy , Management,Suzhou University of Science , Technology,Suzhou,Jiangsu 215009,China 2.College of Management,Fudan University,Shanghai 200433,China
Abstract:Vehicle Routing Problem with Time Windows(VRPTW) is a very important extended type of Vehicle Routing Problem(VRP).Based on the idea of ant colony optimization,a hybrid improved ant algorithm for solving this problem is designed and some Solomon instances are solved.Computational experiments are tested and the results are compared with some other heuristic methods which is promising in good performances.
Keywords:Vehicle Routing Problem with Time Windows(VRPTW)  hybrid ant algorithm  transition probability amending
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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