Advertisement

Hinterland Container Transportation Using Mathematical Programming Approach

  • Elifcan GocmenEmail author
  • Rizvan Erol
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)

Abstract

Container transportation problems include logistics activities conducted in both terminals and hinterland of the terminal. Transferring containers considering cost, time and environmental issues is a difficult problem. Hinterland container transportation (HCT) is defined as the movement of the containers between terminals and customers by different transportation modes. Processes of the hinterland transportation are the most important cost factors for door-to-door services. These problems aim to decide the distribution of the containers considering the cost and time minimization. In this study, a container distribution, routing problem has been proposed in the hinterland. The problem aims to perform the distribution of the containers at minimum total traveling distance. Allocation of containers and the routes under the constraints of routing, capacity is investigated in this study. An integer programming approach has been proposed and solved.

Keywords

Hinterland container transportation Routing problems Mathematical model 

References

  1. Demir, E., Burgholzer, W., Hrusovsky, M., Arıkan, E., Jammernegg, W., & Van Woensel, T. (2016). A green intermodal service network design problem with travel time uncertainty. Transportation Research Part B: Methodological, 93, 789–807.CrossRefGoogle Scholar
  2. Resat, H. G., & Turkay, M. (2015). Design and operation of intermodal transportation network in the Marmara region of Turkey. Transportation Research Part E, 83, 16–33.CrossRefGoogle Scholar
  3. Slack, B. (1993). Pawns in the game: Ports in a global transportation system. Growth and Change, 24, 379–388.CrossRefGoogle Scholar
  4. Sterzik, S., & Kopfer, H. (2013). A tabu search heuristic for the inland container transportation problem. Computers & Operation Research, 40, 953–962.MathSciNetCrossRefGoogle Scholar
  5. Van Klink, H. A., & Van den Berg, G. (1998). Gateways and intermodalism. Journal of Transport Geography, 6, 1–9.CrossRefGoogle Scholar
  6. Verma, M., & Verter, V. (2010). A lead-time based approach for planning rail–truck intermodal transportation of dangerous goods. European Journal of Operation Research, 202, 696–706.CrossRefGoogle Scholar
  7. Verma, M., Verter, V., & Zufferey, N. (2012). A bi-objective model for planning and managing rail-truck intermodal transportation of hazardous materials. Transportation Research Part E, 48, 132–149.CrossRefGoogle Scholar
  8. Wang, W. F., & Yun, W. Y. (2013). Scheduling for inland container truck and train transportation. International Journal of Production Economics, 143, 349–356.CrossRefGoogle Scholar
  9. Yun, W. Y., Wang, W. F., & Ha, B. H. (2013). A hybrid SA algorithm for inland container transportation. International Journal of Industrial Engineering, 20, 12–23.Google Scholar
  10. Zhang, R. Y., Yun, W. Y., & Moon, I. K. (2009). A reactive tabu search algorithm for the multi-depot container truck transportation problem. Transportation Research Part E: Logistics and Transportation Review, 45, 904–914.CrossRefGoogle Scholar
  11. Zhang, R., Yun, W., & Kopfer, Y. H. (2010). Heuristic-based truck scheduling for inland container transportation. OR Spectrum, 32, 787–808.CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Industrial Engineering, Faculty of EngineeringCukurova UniversitySaricam, AdanaTurkey

Personalised recommendations