时间依赖型带软时间窗的越库配送绿色车辆路径问题

  • 打印
  • 收藏
收藏成功


打开文本图片集

中图分类号:TP18 文献标志码:A

Time-dependent green vehicle routing problem for cross-docking with soft time windows

LI Wen, NI Jing (Business School, University of Shanghai for Science and Technology, Shanghai 2Ooo93, China)

Abstract: In response to the problems of high logistics costs,low customer satisfaction and significant pressure for carbon reduction under vehicle routing problem for cross-docking, a method for calculating road travel time across time periods based on time-varying vehicle speeds was proposed, enabling more accurate assessments of cost and time. By comprehensively considering soft time window constraints and the impact of driving speed on carbon emissions, a bi-objective model was developed to simultaneously optimize the conflicting objectives of total system cost and waiting delay time. A hybrid heuristic algorithm combining variable neighborhood search (VNS) and non-dominated sorting genetic algorithm II (NSGA-II) was presented to solve the model. Numerical experiments show that the algorithm effectively solves the model across instances of varying scales and demonstrates high overall performance. The time-varying speed model enhances customer satisfaction compared to static networks.

Keywords: cross-docking; time-dependent; green vehicle routing problem; variable neighborhood search; NSGA-II

越库配送车辆路径问题(vehicleroutingproblemwithcross-docking,VRPCD)是VRP的拓展问题越库配送模式下,货物无需长期存储在配送中心,而是经过分拣、整合后直接转运至下游客户。(剩余16358字)

试读结束

monitor
客服机器人