Abstract
This article focuses on an intermodal freight transport service in which containers represent the moved loading units. In particular, it deals with the advantages of combining sea and road transportation – sea for transferring large quantities over long distances, road for collecting and distributing over short or medium distances. With a view to minimizing the total cost of the service, we formulate a ship-truck intermodal transportation problem as a Travelling Purchaser Problem (TPP), in this way broadening the real-world applications field of the TPP. To tackle this problem, a heuristic algorithm is presented and experimentally tested. Computational results indicate that the algorithm is very efficient on a set of benchmark instances, quickly achieving optimal or near-optimal solutions.
Similar content being viewed by others
References
Arnold, P., Peeters, D. and Thomas, I. (2004) Modelling a rail/road intermodal transportation system. Transportation Research Part E 40: 255–270.
Boctor, F.F., Laporte, G. and Renaud, J. (2003) Heuristics for the traveling purchaser problem. Computers & Operations Research 30: 491–504.
Bontekoning, Y.M., Macharis, C. and Trip, J.J. (2004) Is a new applied transportation research field emerging? – A review of intermodal rail-truck freight transport literature. Transportation Research Part A 38: 1–34.
Ghiani, G., Laporte, G. and Musmanno, R. (2004) Introduction to Logistics Systems Planning and Control. Chichester: John Wiley & Sons.
Golden, B., Levy, L. and Dahl, R. (1981) Two generalizations of the traveling salesman problem. Omega 9: 439–441.
Gutin, G. and Punnen, A.P. (eds.) (2007) The Traveling Salesman Problem and its Variations. New York: Springer-Verlag.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B. (eds.) (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: John Wiley & Sons.
Macharis, C. and Bontekoning, Y.M. (2004) Opportunities for OR in intermodal freight transport research: A review. European Journal of Operational Research 153: 400–416.
Ong, H.L. (1982) Approximate algorithms for the traveling purchaser problem. Operations Research Letters 1: 201–205.
Paletta, G. (2002) The period traveling salesman problem: A new heuristic algorithm. Computers & Operations Research 29: 1343–1352.
Pearn, W.L. and Chien, R.C. (1998) Improved solutions for the traveling purchaser problem. Computers & Operations Research 25: 879–885.
Ramesh, T. (1981) Traveling purchaser problem. Operations Research 18: 78–91.
Riera-Ledesma, J. and Salazar-González, J.J. (2005) A heuristic approach for the travelling purchaser problem. European Journal of Operational Research 162: 142–152.
Rosenkrantz, D.J., Stearns, R.E. and Lewis II, P.M. (1977) An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6: 563–581.
Singh, K.N. and van Oudheusden, D.L. (1997) A branch and bound algorithm for the traveling purchaser problem. European Journal of Operational Research 97: 571–579.
Steenken, D., Voβ, S. and Stahlbock, R. (2004) Container terminal operation and operations research – A classification and literature review. OR Spectrum 26: 3–49.
Teeninga, A. and Volgenant, A. (2004) Improved heuristics for the traveling purchaser problem. Computers & Operations Research 31: 139–150.
Vis, I.F.A. and de Koster, R. (2003) Transshipment of containers at a container terminal: An overview. European Journal of Operational Research 147: 1–16.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Infante, D., Paletta, G. & Vocaturo, F. A ship-truck intermodal transportation problem. Marit Econ Logist 11, 247–259 (2009). https://doi.org/10.1057/mel.2009.6
Published:
Issue Date:
DOI: https://doi.org/10.1057/mel.2009.6