Skip to main content
Top
Published in: OR Spectrum 1/2017

21-05-2016 | Regular Article

When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains

Authors: Nils Boysen, Joachim Scholl, Konrad Stephan

Published in: OR Spectrum | Issue 1/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

An efficient integration of rail transport into the hinterland traffic is an important topic for ports all around the world. In this context, we treat a scheduling problem where multi-trailer trucks (denoted as road trains) deliver containers to some gantry crane, which successively loads the boxes onto freight trains. A road train carries up to a dozen containers, so that a lot of energy is consumed especially when setting a road train in motion. Thus, there is a basic trade-off between the effort of road train and gantry crane. The more often a road train is relocated, the higher its own demand for energy, but the lower that for moving the crane when processing containers rather from nearby holding positions and vice versa. This paper formalizes the novel problem setting and suggests a heuristic decomposition approach, which determines the stop locations of the road train and schedules the gantry crane during the loading process.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
go back to reference Boysen N, Fliedner M (2010) Determining crane areas in intermodal transshipment yards: the yard partition problem. Eur J Oper Res 204:336–342CrossRef Boysen N, Fliedner M (2010) Determining crane areas in intermodal transshipment yards: the yard partition problem. Eur J Oper Res 204:336–342CrossRef
go back to reference Boysen N, Stephan K (2016) A survey on single crane scheduling in automated storage/retrieval systems. Eur J Oper Res (to appear) Boysen N, Stephan K (2016) A survey on single crane scheduling in automated storage/retrieval systems. Eur J Oper Res (to appear)
go back to reference Boysen N, Fliedner M, Jaehn F, Pesch E (2013) A survey on container processing in railway yards. Transp Sci 47:312–329CrossRef Boysen N, Fliedner M, Jaehn F, Pesch E (2013) A survey on container processing in railway yards. Transp Sci 47:312–329CrossRef
go back to reference Boysen N, Briskorn D, Meisel F (2014) A generalized classification scheme for crane scheduling with interference. In: Working paper Friedrich-Schiller-University Jena Boysen N, Briskorn D, Meisel F (2014) A generalized classification scheme for crane scheduling with interference. In: Working paper Friedrich-Schiller-University Jena
go back to reference Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115–119CrossRef Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115–119CrossRef
go back to reference Cordeau J-F, Legato P, Mazza RM, Trunfio R (2015) Simulation-based optimization for housekeeping in a container transshipment terminal. Comput Oper Res 53:81–95CrossRef Cordeau J-F, Legato P, Mazza RM, Trunfio R (2015) Simulation-based optimization for housekeeping in a container transshipment terminal. Comput Oper Res 53:81–95CrossRef
go back to reference Duinkerken MB, Dekker R, Kurstjens ST, Ottjes JA, Dellaert NP (2006) Comparing transportation systems for inter-terminal transport at the Maasvlakte container terminals. OR Spectr 28:469–493CrossRef Duinkerken MB, Dekker R, Kurstjens ST, Ottjes JA, Dellaert NP (2006) Comparing transportation systems for inter-terminal transport at the Maasvlakte container terminals. OR Spectr 28:469–493CrossRef
go back to reference Ferreira L, Sigut J (1993) Measuring the performance of intermodal freight terminals. Transp Plan Technol 17:268–279CrossRef Ferreira L, Sigut J (1993) Measuring the performance of intermodal freight terminals. Transp Plan Technol 17:268–279CrossRef
go back to reference Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York
go back to reference Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12:655–679CrossRef Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12:655–679CrossRef
go back to reference Goetschalckx M, Ratliff HD (1988) An efficient algorithm to cluster order picking items in a wide aisle. Eng Costs Prod Econ 13:263–271CrossRef Goetschalckx M, Ratliff HD (1988) An efficient algorithm to cluster order picking items in a wide aisle. Eng Costs Prod Econ 13:263–271CrossRef
go back to reference HK (2013) Hafen Hamburg auf einen Blick (in German). Handelskammer Hamburg, Hamburg HK (2013) Hafen Hamburg auf einen Blick (in German). Handelskammer Hamburg, Hamburg
go back to reference Kellner M, Boysen N, Fliedner M (2012) How to park freight trains on rail–rail transshipment yards: the train location problem. OR Spectr 34:535–561CrossRef Kellner M, Boysen N, Fliedner M (2012) How to park freight trains on rail–rail transshipment yards: the train location problem. OR Spectr 34:535–561CrossRef
go back to reference Kozan E (1997) Increasing the operational efficiency of container terminals in Australia. J Oper Res Soc 48:151–161CrossRef Kozan E (1997) Increasing the operational efficiency of container terminals in Australia. J Oper Res Soc 48:151–161CrossRef
go back to reference Miller C, Tucker A, Zemlin R (1960) Integer programming formulations and travelling salesman problems. J ACM 7:326–329CrossRef Miller C, Tucker A, Zemlin R (1960) Integer programming formulations and travelling salesman problems. J ACM 7:326–329CrossRef
go back to reference Nishimura E, Imai A, Papadimitriou S (2005) Yard trailer routing at a maritime container terminal. Transp Res Part E Logist Transp Rev 41:53–76CrossRef Nishimura E, Imai A, Papadimitriou S (2005) Yard trailer routing at a maritime container terminal. Transp Res Part E Logist Transp Rev 41:53–76CrossRef
go back to reference Otto B, Boysen N (2014) A dynamic programming based heuristic for locating stops in public transportation networks. Comput Ind Eng 78:163–174CrossRef Otto B, Boysen N (2014) A dynamic programming based heuristic for locating stops in public transportation networks. Comput Ind Eng 78:163–174CrossRef
go back to reference Potvin JY, Guertin F (1998) A genetic algorithm for the clustered traveling salesman problem with a prespecified order on the clusters. Advances in computational and stochastic optimization, logic programming, and heuristic search. Springer, New York, pp 287–299CrossRef Potvin JY, Guertin F (1998) A genetic algorithm for the clustered traveling salesman problem with a prespecified order on the clusters. Advances in computational and stochastic optimization, logic programming, and heuristic search. Springer, New York, pp 287–299CrossRef
go back to reference Rotter H (2004) New operating concepts for intermodal transport: the mega hub in Hanover/Lehrte in Germany. Transp Plan Technol 27:347–365CrossRef Rotter H (2004) New operating concepts for intermodal transport: the mega hub in Hanover/Lehrte in Germany. Transp Plan Technol 27:347–365CrossRef
go back to reference Schaefer T (1978) The complexity of satisfiability problem. In: Proceedings of the 10th ACM symposium on theory of computing (STOC’78), pp 216–226 Schaefer T (1978) The complexity of satisfiability problem. In: Proceedings of the 10th ACM symposium on theory of computing (STOC’78), pp 216–226
go back to reference Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spectr 26:3–49CrossRef Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spectr 26:3–49CrossRef
go back to reference Tierney K, Voß S, Stahlbock R (2013) A mathematical model of inter-terminal transportation. Eur J Oper Res 235:448–460CrossRef Tierney K, Voß S, Stahlbock R (2013) A mathematical model of inter-terminal transportation. Eur J Oper Res 235:448–460CrossRef
go back to reference Vis IF, De Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1–16CrossRef Vis IF, De Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1–16CrossRef
Metadata
Title
When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains
Authors
Nils Boysen
Joachim Scholl
Konrad Stephan
Publication date
21-05-2016
Publisher
Springer Berlin Heidelberg
Published in
OR Spectrum / Issue 1/2017
Print ISSN: 0171-6468
Electronic ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-016-0446-y

Other articles of this Issue 1/2017

OR Spectrum 1/2017 Go to the issue