引用本文:唐加福,孔 媛,潘震东,董 颖.基于划分的蚁群算法求解货物权重车辆路径问题[J].控制理论与应用,2008,25(4):699~702.[点击复制]
TANG Jia-fu,KONG Yuan,PAN Zhen-dong,DONG Ying.An ant colony optimization algorithm for vehicle routing problem with cargo coefficient[J].Control Theory and Technology,2008,25(4):699~702.[点击复制]
基于划分的蚁群算法求解货物权重车辆路径问题
An ant colony optimization algorithm for vehicle routing problem with cargo coefficient
摘要点击 1457  全文点击 2004  投稿时间：2006-11-08  修订日期：2007-06-14
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  2008,25(4):699-702
中文关键词  车辆路径问题  货物权重  蚁群算法
英文关键词  vehicle routing problem (VRP)  cargo coefficient  ant colony optimization
基金项目  国家杰出青年科学基金资助项目(70625001); 国家自然科学基金资助项目(70721001,70601004); 教育部科技研究重点项目(104064); 教育部新世纪优秀人才支持计划(NCET-04-280).
作者单位E-mail
唐加福 东北大学 流程工业综合自动化教育部重点实验室, 辽宁 沈阳 110004 jftang@mail.neu.edu.cn 
孔 媛 东北大学 流程工业综合自动化教育部重点实验室, 辽宁 沈阳 110004 yokery@126.com 
潘震东 东北大学 流程工业综合自动化教育部重点实验室, 辽宁 沈阳 110004  
董 颖 东北大学 流程工业综合自动化教育部重点实验室, 辽宁 沈阳 110004  
中文摘要
      考虑单产品分销网络中的车辆路径问题(VRP: vehicle routing problem). 与以往诸多研究不同的是, 建立了一种带货物载重量的VRP模型(weighted VRP), 即车辆在两个顾客之间行驶时的载重量也作为影响运输费用的一个因素考虑. 因此, 需求量较大的顾客拥有较高的车辆运输优先权. 在分析了问题性质的基础上, 提出一种基于划分策略的蚁群算法PMMAS求解货物权重车辆路径问题, 并与其他常用的启发式算法进行比较分析, 表明了算法的有效性.
英文摘要
      A distribution network between one warehouse and multiple retailers is considered. A model named weighted vehicle routing problem(VRP) is built. Being contrary to many other VRP models, the weight loaded in a vehicle through a route between two customers is considered as an important factor of system cost when a routing decision is made. With this method, the retailers with larger demands will have priority to be visited earlier. Finally, an ant colony optimization algorithm named PMMAS (partition based max-min ant system) combined with a special partition method is proposed to solve this model. Some illustrative examples are introduced to test the efficiency of the PMMAS, and comparison analysis is conducted with commonly used heuristic algorithms for vehicle routing problem.