Skip to main content
SpringerLink
Log in

An intermodal multicommodity routing problem with scheduled services

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We study a multicommodity routing problem faced by an intermodal service operator that uses ground and maritime transportation. Given a planning horizon, a set of commodities to be picked up at their release times and to be delivered not later than their duedates, the problem is to decide on routes for these commodities using trucks and scheduled and capacitated maritime services at minimum cost of transportation and stocking at the seaports. Two mixed integer programming formulations and valid inequalities are proposed for this problem. The results of a computational study to evaluate the strength of the linear programming relaxations and the solution times are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, New York (1993)

    MATH  Google Scholar 

  2. Barnhart, C., Ratliff, H.D.: Modeling intermodal routing. J. Bus. Logist. 14, 205–223 (1993)

    Google Scholar 

  3. Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48, 318–326 (2000)

    Article  Google Scholar 

  4. Bektas, T., Crainic, T.G.: A brief overview of intermodal transportation. Technical Report, CIRRELT-2007-03, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (2007)

  5. Boardman, B.S., Malstrom, E.M., Butler, D.P., Cole, M.H.: Computer assisted routing of intermodal shipments. Comput. Ind. Eng. 33, 311–314 (1997)

    Article  Google Scholar 

  6. Bontekoning, Y.M., Macharis, C., Trip, J.J.: Is a new applied transportation research field emerging?—A review of intermodal rail-truck freight transport literature. Transp. Res. A 38, 1–34 (2004)

    Article  Google Scholar 

  7. Bookbinder, J.H., Fox, N.S.: Intermodal routing of Canada-Mexico shipments under NAFTA. Transp. Res. E 34, 289–303 (1998)

    Article  Google Scholar 

  8. Boussedjra, M., Bloch, C., El Moudni, A.: An exact method to find the intermodal shortest path. In: Proceedings of the IEEE International Conference on Networking, Sensing & Control, pp. 1075–1080 (2004)

    Chapter  Google Scholar 

  9. Chang, T.S.: Best routes selection in international intermodal networks. Comput. Oper. Res. 35, 2877–2891 (2008)

    Article  MATH  Google Scholar 

  10. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime transportation. In: Barnhart, C., Laporte, G. (eds.) Handbook in OR & MS, vol. 14, pp. 189–284. Elsevier, Amsterdam (2007)

    Google Scholar 

  11. Crainic, T.G., Kim, K.H.: Intermodal transportation. In: Barnhart, C., Laporte, G. (eds.) Handbook in OR & MS, vol. 14, pp. 467–537. Elsevier, Amsterdam (2007)

    Google Scholar 

  12. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  13. Grasman, S.E.: Dynamic approach to strategic and operational multimodal routing decisions. Int. J. Logist. Syst. Manag. 2, 96–106 (2006)

    Article  Google Scholar 

  14. Kim, H.J., Chang, Y.T., Lee, P.T.T., Shin, S.H., Kim, M.J.: Optimizing the transportation of intermodal container cargoes in Korea. Marit. Policy Manag. 35, 103–122 (2008)

    Article  Google Scholar 

  15. Macharis, B., Bontekoning, Y.M.: Opportunities for OR in intermodal freight transportation research: a review. Eur. J. Oper. Res. 153, 400–416 (2004)

    Article  MATH  Google Scholar 

  16. Min, H.: International intermodal choices via change-constrained goal programming. Transp. Res. A 25, 351–362 (1991)

    Article  Google Scholar 

  17. Moccia, L., Cordeau, J.F., Laporte, G., Ropke, S., Valentini, M.P.: Modeling and solving a multimodal routing problem with timetables and time windows. Networks (to appear)

  18. Pedersen, M.B.: Optimization models and solution methods for intermodal transportation. PhD Thesis, Technical University of Denmark, Centre for Traffic and Transport (2005)

  19. Slack, B.: Intermodal Transportation. In: Brewer, A.M., Button, K.J., Hensher, D.A. (eds.) Handbook of Logistics and Supply-Chain Management, pp. 141–154. Pergamon, Elmsford (2001)

    Google Scholar 

  20. Song, H., Chen, G.: Minimum cost delivery problem in intermodal transportation networks. In: Proceedings of the 2007 IEEE IEEM, pp. 1502–1506 (2007)

    Google Scholar 

  21. Wolsey, L.A.: Integer Programming. Wiley, New York (1998)

    MATH  Google Scholar 

  22. Ziliaskopoulos, A., Wardell, W.: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. Eur. J. Oper. Res. 125, 486–502 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Bilkent University, 06800, Ankara, Turkey

    Burak Ayar & Hande Yaman

Authors
  1. Burak Ayar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hande Yaman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Burak Ayar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ayar, B., Yaman, H. An intermodal multicommodity routing problem with scheduled services. Comput Optim Appl 53, 131–153 (2012). https://doi.org/10.1007/s10589-011-9409-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-011-9409-z

Keywords

Search

Navigation