武汉理工大学学报(交通科学与工程版)2024,Vol.48Issue(2) :385-391.DOI:10.3963/j.issn.2095-3844.2024.02.032

集配协同下多产品越库配送车辆路径问题研究

Research on Vehicle Routing Problem of Multi-product Cross-warehouse Distribution under the Coordination of Collection and Distribution

王长琼 杨畅
武汉理工大学学报(交通科学与工程版)2024,Vol.48Issue(2) :385-391.DOI:10.3963/j.issn.2095-3844.2024.02.032

集配协同下多产品越库配送车辆路径问题研究

Research on Vehicle Routing Problem of Multi-product Cross-warehouse Distribution under the Coordination of Collection and Distribution

王长琼 1杨畅1
扫码查看

作者信息

  • 1. 武汉理工大学交通与物流工程学院 武汉 430063
  • 折叠

摘要

文中基于实际越库配送中零售商的多样化需求和集配过程的连续型,针对集配协同下的多产品车辆路径问题,构建以车辆固定成本、运输成本、时间窗惩罚成本和库存持有成本最小化为目标的带越库配送的车辆路径优化模型.根据问题的阶段性特征,提出一种改进的遗传算法对问题进行求解,并以车辆等待时间最小为准则设计解码方案.通过算例的对比分析,验证了改进的遗传算法有更强的寻优能力.结果表明:建立的模型能够有效降低总成本,提高运输效率.

Abstract

Based on the diversified needs of retailers and the continuity of the collection and distribution process in the actual cross-warehouse distribution,aiming at the multi-product vehicle routing prob-lem under the coordination of collection and distribution,an optimization model of vehicle routing with cross-warehouse distribution was established,which aimed at minimizing the fixed cost,transporta-tion cost,time window penalty cost and inventory holding cost.According to the stage characteristics of the problem,an improved genetic algorithm was proposed to solve the problem,and the decoding scheme was designed with the minimum waiting time of vehicles as the criterion.Through the compar-ative analysis of examples,it is verified that the improved genetic algorithm has stronger optimization ability.The results show that the established model can effectively reduce the total cost and improve the transportation efficiency.

关键词

越库配送/集配协同/车辆路径问题/改进遗传算法

Key words

cross-docking/collaborative collection and distribution/vehicle routing problem/improved genetic algorithm

引用本文复制引用

出版年

2024
武汉理工大学学报(交通科学与工程版)
武汉理工大学

武汉理工大学学报(交通科学与工程版)

CSTPCD
影响因子:0.462
ISSN:2095-3844
参考文献量3
段落导航相关论文