考虑临时配送的动态车辆路径规划研究  

Research on Dynamic Vehicle Path Planning Considering Temporary Delivery

作　　者：李盛威 童泽平[1] LI Shengwei;TONG Zeping(Wuhan University of Science and Technology,Wuhan 430065,China)

机构地区：[1]武汉科技大学,湖北武汉430065

出　　处：《物流科技》2024年第8期83-88,共6页Logistics Sci-Tech

摘　　要：文章研究了客户请求的配送车辆呈动态化的车辆路径规划问题,在该问题中,客户请求的动态化可能在配送计划制定时已知,也可能在任一配送时间节点更新;配送车辆的动态化体现在管理配送的公司配备固定的车队进行配送,也有临时的司机通过接单形式提供服务,且临时配送与对应时间窗相关联。文章的研究目的是确定分配成本最小化的分配计划,分配成本由常规车辆成本、支付给接单司机补偿款项和罚款成本共同构成。该问题研究基于大邻域搜索算法和遗传算法设计优化算子,探索处理动态请求并实时调整路径规划的分配计划。通过计算研究与灵敏度分析评估算法性能,确定其解决动态问题的可行性与优势。The paper studies the dynamic vehicle path planning problem of delivery vehicles requested by customers.In this issue,the dynamism of customer requests may be known during the development of delivery plans,or may be updated at any delivery time node.The dynamism of delivery vehicles is reflected in the management of delivery companies equipped with fixed fleets for delivery,as well as temporary drivers providing services through order taking,and temporary delivery is associated with corresponding time windows.The research objective of this paper is to determine an allocation plan that minimizes allocation costs,which consist of regular vehicle costs,compensation payments to drivers who receive orders,and penalty costs.Based on the design of optimization operators using large neighborhood search algorithms and genetic algorithms,the paper explores the allocation plan for handling dynamic requests and real-time adjustment of path planning.The paper evaluates the performance of algorithms through computational research and sensitivity analysis to determine their feasibility and advantages in solving dynamic problems.

关 键 词：动态车辆路径规划 大邻域搜索算法 遗传算法 优化算法 

分 类 号：F252[经济管理—国民经济]