期刊文献+

可折叠集装箱接驳运输问题的建模与优化 被引量:5

Modeling and optimization of a drayage problem with foldable containers
原文传递
导出
摘要 对一类带时间窗的可折叠箱接驳运输问题进行了研究,其中使用可折叠箱在堆场与客户之间集散货物,一辆集卡可装载一个满箱或多个空箱,目标为集卡总工作时间的最小化.借鉴确定的活动在顶点上的图的思想,将该问题分解为满箱子问题和空箱子问题,其中满箱子问题类似于带时间窗的多旅行商问题,空箱子问题因客户的货物量可为负值而显著区别于车辆路径问题,且两个子问题之间存在访问时间耦合等关联.进而建立了问题的数学描述,设计了问题的主动禁忌搜索(reactive tabu search,RTS)求解算法,并基于随机生成的大量算例验证了算法的有效性.结果表明,相比于使用CPLEX等优化软件,RTS算法可以在更短的时间内求得问题的更优解;相比于使用标准箱的情形,使用可折叠箱可节省约13%的接驳成本. This paper investigates a drayage problem with foldable containers and time windows. In this problem, foldable containers are used to collect and distribute freight between customers and the depot, and a truck could carry one loaded container or several (folded) empty containers. The objective of this problem is to minimize the total working time of trucks. Inspired by the determined-activities-on-vertex graph, the problem is decomposed into a loaded container sub-problem and an empty container sub-problem. The former one is similar to multi-traveling salesman problem with time windows. The latter one differs from vehicle routing problem because the amount of freight of customers could be negative. Furthermore, they couple each other in several aspects such as the visiting time of customers. The problem is mathematically formulated and then solved based on reactive tabu search (RTS) algorithm. A large number of randomly generated instances validate the model and algorithm presented above. The results indicate that the RTS algorithm can provide much better solutions of the problem in a much shorter time than typical optimization software such as CPLEX and that the use of foldable containers can save approximately 13% of drayage costs compared to the use of standard containers.
作者 张瑞友 赵海舒 刘士新 ZHANG Ruiyou;ZHAO Haishu;LIU Shixin(College of Information Science and Engineering, Northeastern University, Shenyang 110819, China)
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2018年第4期1013-1023,共11页 Systems Engineering-Theory & Practice
基金 国家重点研发计划(2017YFB0306401) 国家自然科学基金(71471034,61573089) 中央高校基本科研业务费专项基金项目(N160404011)~~
关键词 可折叠集装箱 接驳运输 主动禁忌搜索 数学模型 优化算法 foldable container drayage reactive tabu search mathematical model optimization algorithm
  • 引文网络
  • 相关文献

参考文献1

二级参考文献15

  • 1Gunther H O, Kim K H. Container terminals and terminal operations[J]. OR Spectrum, 2006, 28(4): 437-445.
  • 2Vis I F A, de Koster R. Transshipment of containers at a container terminal: An overview[J]. European Journal of Operational Research, 2003, 147(1): 1-16.
  • 3Macharis C, Bontekoning Y M. Opportunities for OR in intermodal freight transport research: A review[J]. European Journal of Operational Research, 2004, 153(2): 400-416.
  • 4Steenken D, Voβ S, Stahlbock R. Container terminal operation and operations research -- A classification and literature review[J]. OR Spectrum, 2004, 26(1): 3 49.
  • 5Cheung R K, Shi N, Powell W B, et al. An attribute-decision model for cross-border drayage problem[J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(2): 217-234.
  • 6Namboothiri R, Erera A L. Planning local container drayage operations given a port access appointment sys- tem[J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(2): 185-202.
  • 7Imai A, Nishimura E, Current J. A Lagrangian relaxation-based heuristic for the vehicle routing with full container load[J]. European Journal of Operational Research, 2007, 176(1): 87-105.
  • 8Coslovich L, Pesenti R, Ukovich W. Minimizing fleet operating costs for a container transportation company[J]. European Journal of Operational Research, 2006, 171(3): 776-786.
  • 9Jula H, Dessouky M, Ioannou P, et al. Container movement by trucks in metropolitan networks: Modeling and optimization[J]. Transportation Research Part E: Logistics and Transportation Review, 2005, 41(3): 235-259.
  • 10Chung K H, Ko C S, Shin J Y, et al. Development of mathematical models for the container road transportation in Korean trucking industries[J]. Computers & Industrial Engineering, 2007, 53(2): 252-262.

共引文献3

同被引文献76

引证文献5

二级引证文献11

;
使用帮助 返回顶部