期刊文献+

多行程多交货期的成品油配送优化 被引量:1

Optimization of refined oil distribution with multiple trips and multiple due time
原文传递
导出
摘要 研究多行程多交货期的成品油配送优化问题,已知油库使用带运输时间窗的多舱车辆配送各加油站的多个订单,每个加油站具有各自的优先级,且加油站的各个订单带有交货期.综合考虑客户优先级、订单交货期和车辆运输时间窗等因素,以配送收益最大化为目标,建立多行程多交货期的成品油配送优化模型,并设计带交货期移除算子的改进变邻域搜索算法进行求解.基于前向插入启发式算法构造初始解,设计基于订单交货期的邻域扰动算子和基于单位时间收益最大化的贪婪策略,以增强算法的局部寻优能力,并提出基于逆序访问的后期优化策略,从而在保证解的质量情况下加快算法收敛速度.通过不同规模下的仿真实验验证了所提出模型和算法在最大化配送收益的同时,能够有效地提高配送及时性. This paper studies the optimization problem of refined oil distribution with multiple trips and multiple due time. Oil depots use multi-cabin vehicles with transportation time windows to distribute multiple orders from each gas station. Each gas station has its own priority, and each order of one gas station has a due time. Comprehensively considering factors including customer priority, order due time, and vehicle transportation time window, with the goal of maximizing distribution revenue, a distribution optimization model of refined oil with multiple trips and multiple due time is established. The improved variable neighborhood search algorithm with the due time removal operator is used to solve the problem. An initial solution based on pushing forward insertion heuristic is constructed. The neighborhood perturbation operator is designed according to the order due time, and a greedy strategy based on the maximum return per unit time is designed to enhance the local optimization ability of the algorithm. A later optimization strategy based on reverse order access is proposed to speed up the convergence speed while ensuring the quality of the solution. The effectiveness of the algorithm is verified by simulation experiments under different scales. The experimental results show that the proposed model and algorithm can not only maximize the distribution revenue, but also effectively improve timeliness of delivery.
作者 高海龙 谢勇 马吉祥 张波 GAO Hai-long;XIE Yong;MA Ji-xiang;ZHANG Bo(School of Artificial Intelligence and Automation,Huazhong University of Science and Technology,Wuhan 430074,China;Shanghai Xingyi Information Technology Co.Ltd.,Shanghai 200439,China)
出处 《控制与决策》 EI CSCD 北大核心 2022年第10期2714-2722,共9页 Control and Decision
基金 国家自然科学基金项目(71771096) 国家自然科学基金创新群体项目(71821001)。
关键词 多行程 订单交货期 运输时间窗 客户优先级 成品油配送 变邻域搜索算法 multi-trip order due time transportation time window customer priority refined oil distribution variable neighborhood search algorithm
  • 相关文献

参考文献7

二级参考文献46

  • 1任传祥,张海,范跃祖.混合遗传-模拟退火算法在公交智能调度中的应用[J].系统仿真学报,2005,17(9):2075-2077. 被引量:30
  • 2宋伟刚,张宏霞,佟玲.有时间窗约束非满载车辆调度问题的遗传算法[J].系统仿真学报,2005,17(11):2593-2597. 被引量:32
  • 3娄山佐,史忠科.基于分解协调原理的大规模动态车辆调度[J].系统仿真学报,2006,18(4):998-1001. 被引量:6
  • 4王海星,王德占,申金升.蚁群算法解决有时间窗的车辆优化调度问题研究[J].物流技术,2006,25(11):37-40. 被引量:16
  • 5Dantzig G B, Ramser J H. The Truck Dispatching Problem [J]. Management Science (S0025-1909), 1959, 6(1): 80-91.
  • 6Kamlesh Mathur, Ronald H. Ballou. Stochastic Vehicle Routing Problem with Restocking [J]. Transportation Science (S0041-1655), 2000, 34(2):99-112.
  • 7William P Nanry, J Wesley Barnes. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search [J].Transportation Research Part B (S0191-2615), 2000, 34(2): 107-121.
  • 8Tan K C, Lee L H, Zhu Q L, Ou K. Heuristic Methods for Vehicle Routing Problem with Time Windows [J]. Artificial Intelligence in Engineering (S0954-1810), 2001, 15(3): 281-295.
  • 9Mak K L, Guo Z G. A Genetic Algorithm for Vehicle Routing Problems with Stochastic Demand and Soft Time Windows [C]// Proceedings of the 2004 Systems and Information Engineering Design Symposium. 2004: 183-190. USA: UNIV VIRGINIA,
  • 10David Pisinger, Stefan Ropke. A General Heuristic for Vehicle Routing Problems [J]. Computer & Operation Research (S0305-0548), 2007, 34(8): 2403-2435.

共引文献81

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部