Advertisement

A Two-Stage Iterative Solution Approach for Solving a Container Transportation Problem

  • Mengqi Wang
  • Bingjie Liu
  • Jiewei Quan
  • Julia Funke
Conference paper
Part of the Lecture Notes in Logistics book series (LNLO)

Abstract

The Inland Container Transportation Problem defines the movement of fully loaded and empty containers among terminals, depots, and customers within the same inland area. All kinds of customer requests are organized by one trucking company that owns depots containing a homogeneous fleet of trucks and a sufficiently large set of empty containers. The objective of this study is to minimize the total distance the trucks travel. We present a two-stage iterative solution approach that is capable to optimize around 300 requests. In the first step, the set of requests is divided into subsets, a tabu list prevents returns to recently considered subsets. In the second step, a mathematical problem is solved for each subset. These steps are then repeated and the best known solution is updated so long as certain stopping criteria are not met. The approach is implemented in C++ using IBM ILOG CPLEX. The quality was verified by several computational experiments.

Keywords

Tabu Search Optimal Route Tabu List Empty Container Saving Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Braekers K, Caris A, Janssens GK (2013) Integrated planning of loaded and empty container movements. OR Spectr 35(2):457–478MathSciNetCrossRefzbMATHGoogle Scholar
  2. Caris A, Janssens GK (2009) A local search heuristic for the pre-and end-haulage of intermodal container terminals. Comput Oper Res 36(10):2763–2772CrossRefzbMATHGoogle Scholar
  3. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRefGoogle Scholar
  4. Glover F (1986) Future paths for integer programming and links to artificial intelligence1986. Comput Oper Res 13(5):533–549MathSciNetCrossRefzbMATHGoogle Scholar
  5. Imai A, Nishimura E, Current J (2007) A lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur J Oper Res 176(1):87–105MathSciNetCrossRefzbMATHGoogle Scholar
  6. Jula H, Dessouky M, Ioannou P, Chassiakos A (2005) Container movement by trucks in metropolitan networks: modeling and optimization. Transp Res Part E Logistics Transp Rev 41(3):235–259CrossRefGoogle Scholar
  7. Jula H, Chassiakos A, Ioannou P (2006) Port dynamic empty container reuse. Transp Res Part E Logistics Transp Rev 42(1):43–60CrossRefGoogle Scholar
  8. Lai M, Crainic TG, Di Francesco M, Zuddas P (2013) An heuristic search for the routing of heterogeneous trucks with single and double container loads. Transp Res Part E Logistics Transp Rev 56:108–118CrossRefGoogle Scholar
  9. Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. Eur J Oper Res 153:400–416CrossRefzbMATHGoogle Scholar
  10. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling sales-man problems. J ACM (JACM) 7(4):326–329MathSciNetCrossRefzbMATHGoogle Scholar
  11. Nossack J, Pesch E (2013) A truck scheduling problem arising in intermodal container transportation. Eur J Oper Res 230:666–680MathSciNetCrossRefGoogle Scholar
  12. Smilowitz K (2006) Multi-resource routing with flexible tasks: an application in drayage operations. IIE Trans 38(7):577–590CrossRefGoogle Scholar
  13. Sterzik S, Kopfer H (2013) A tabu search heuristic for the inland container transportation problem. Comput Oper Res 40:953–962MathSciNetCrossRefGoogle Scholar
  14. Sterzik S, Kopfer H, Yun WY Reducing hinterland transportation costs through container sharing. Flex Serv Manuf J, 1–21 (2012)Google Scholar
  15. Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transp Res Part B 36:97–112CrossRefGoogle Scholar
  16. Zhang R, Yun WY, Moon I (2009) A reactive tabu search algorithm for the multi-depot container truck transportation problem. Transp Res Part E Logistics Transp Rev 45(6):904–914CrossRefGoogle Scholar
  17. Zhang R, Yun WY, Kopfer H (2010) Heuristic-based truck scheduling for inland container transportation. OR Spect 32:787–808CrossRefzbMATHGoogle Scholar
  18. Zhang R, Yun WY, Moon IK (2011) Modeling and optimization of a container drayage problem with resource constraints. Int J Prod Econ 133(1):351–359CrossRefGoogle Scholar
  19. Zhang R, Yun WY, Kopfer H Multi-size container transportation by truck: modeling and optimization. Flex Serv Manuf J, 1–28 (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Mengqi Wang
    • 1
  • Bingjie Liu
    • 1
  • Jiewei Quan
    • 1
  • Julia Funke
    • 1
  1. 1.Lehrstuhl für LogistikUniversität BremenBremenGermany

Personalised recommendations