考虑需求单元化拆分下同时交付的多时间窗车辆路径规划
DOI:
作者:
作者单位:

上海海事大学 物流科学与工程研究院

作者简介:

通讯作者:

中图分类号:

U116

基金项目:

国家重点研发计划资助项目(2019YFB1704403)


Multi-time window vehicle path planning considering simultaneous delivery under demand unitization
Author:
Affiliation:

Institute of Logistics Science Engineering,Shanghai Maritime University

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对多时间窗下的需求拆分的车辆路径问题,考虑在多时间窗下的同时交付,构建了相关问题的多目标优化模型。结合需求拆分中两种拆分方式依据订单和依据商品类型,使用单元化拆分方式,以Solomon标准算例为基础构造算例,使用改进的蚁群算法进行测试,并将其同其他算法对比改进算法的效果,之后考虑拆分成本的基础上同依据订单拆分和依据商品类型拆分对比单元化拆分的效果,结果表明,改进蚁群算法效果较好且单元化拆分在部分数据集上更加节约成本。

    Abstract:

    The vehicle routing problem of demand splitting under multiple time windows was studied, and the simultaneous delivery under multiple time windows was considered, and a multi-objective optimization model of related problems was constructed. It combined the two splitting methods in demand splitting according to the order and according to the type of goods, the unitized splitting method was used, and the calculation example was constructed based on the Solomon standard calculation example. The improved ant colony algorithm was used for testing, and compared the effects of the improved algorithm with other algorithms, and then compared the effects of the unitized splitting based on the order splitting and the splitting based on the product type on the basis of the classification cost. The results show that the improved ant colony algorithm is effective and unitized splitting is more cost-effective on some data sets.

    参考文献
    相似文献
    引证文献
引用本文

夏军,苌道方,宋鑫. 考虑需求单元化拆分下同时交付的多时间窗车辆路径规划[J]. 科学技术与工程, , ():

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2021-12-06
  • 最后修改日期:2022-06-26
  • 录用日期:2022-07-06
  • 在线发布日期:
  • 出版日期:
×
亟待确认版面费归属稿件,敬请作者关注