计算机集成制造系统 ›› 2018, Vol. 24 ›› Issue (第3): 570-582.DOI: 10.13196/j.cims.2018.03.004

• 当期目次 • 上一篇    下一篇

基于离散布谷鸟算法求解带时间窗和同时取送货的车辆路径问题

王超1,2,3,刘超1,3,穆东4+,高扬1,3   

  1. 1.北京工业大学经济与管理学院
    2.波士顿大学物理系
    3.北京现代制造业发展研究基地
    4.北京交通大学经济与管理学院
  • 出版日期:2018-03-31 发布日期:2018-03-31
  • 基金资助:
    国家自然科学基金青年基金资助项目(61603011,61603010);国家自然科学基金面上资助项目(61773029,71772016);博士后国际交流计划资助项目(20170016);中国博士后科学基金资助项目(2015M580033);北京市博士后科学基金资助项目(2016ZZ-11);首都社会建设与社会管理协同创新中心资助项目。

VRPSPDTW problem solving by discrete cuckoo search

  • Online:2018-03-31 Published:2018-03-31
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.61603011,61603010,61773029,71772016),the International Postdoctoral Exchange Fellowship Program,China(No.20170016),the China Postdoctoral Science Foundation,China(No.2015M580033),the Beijing Postdoctoral Science Foundation,China(No.2016ZZ-11),and the Capital Social Construction and Social Management Collaborative Innovation Center Foundation,China.

摘要: 为求解带时间窗和同时取送货的车辆路径问题(VRPSPDTW),提出一种离散布谷鸟(DCS)算法,该算法在标准布谷鸟算法的基础上,在Lévy飞行位置更新过程中,使用路径内搜索2-opt法和路径间搜索swap/shift法改进当前巢穴;在寄生巢位置更新过程中,使用路径内搜索relocate/exchange法和路径间搜索GENE法,随机产生新巢穴。选取Wang和Chen测试数据集,对算法性能进行测试,并与遗传算法和并行模拟退火算法进行比较。测试结果显示,在9个中小型顾客规模算例中,DCS算法获取了所有的当前国际最优解,在56个大型顾客规模的算例中,DCS算法在5个算例中更新了当前国际最优解,在17个算例中获取了当前国际最优解。通过Rank值法对这3种算法进行Friedman检验和Wilcoxon秩检验,结果表明所提DCS算法的有效性。

关键词: 车辆路径问题, 同时取送货, 时间窗, 布谷鸟算法

Abstract: To solve the Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows (VRPSPDTW),a Discrete Cuckoo Search (DCS) algorithm was presented.Based on the standard cuckoo search,the current nest was improved by using intra-route improvement method 2-opt move and inter-route improvement method swap/shift move during the process of Lévy flight position update,and a new nest was selected randomly by using intra-route improvement method relocate/exchange move and inter-route improvement method GENE move during the process of nest position update.The performance of DCS algorithm was tested and compared with genetic algorithm and parallel-simulated annealing algorithm.Computational results showed that the proposed DCS was able to achieve the Best Known Solution (BKS) as 100% of the 9 small-to-medium instances.For the large scale instances,DCS obtained better solutions for 5 instances,and equaled BKS in 17 instances.These three algorithms were compared based on Friedman test and Wilcoxon signed-rank test with Rank value method,and the result showed that DCS was an effective method for solving VRPSPDTW problem.

Key words: vehicle routing problem, simultaneous pickup and delivery, time windows, cuckoo search

中图分类号: