New Solution Approaches for the Train Load Planning Problem

The present paper faces the train load planning problem in container terminals. The problem consists of assigning containers to rail wagons while maximizing the total priority of the containers loaded and minimizing the number of rehandles executed in the terminal yard. Two different heuristic approaches, based on an innovative way to compute weight limitations and on two 0/1 integer programming models, are proposed and compared on the basis of specific key performance indicators. The heuristic approaches are compared using random generated instances based on real-world data. An extensive computational analysis has been performed.

• Record URL:
  • https://doi.org/10.1007/s13676-018-0127-x
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/21924376
• Supplemental Notes:
  • © 2018 Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies.
• Authors:
  • Ambrosino, Daniela
  • Caballini, Claudia
  • 0000-0003-1318-2571
• Publication Date: 2019-9

Language

• English

Media Info

• Media Type: Web
• Features: Appendices; Figures; References;
• Pagination: pp 299-325
• Serial:
  • EURO Journal on Transportation and Logistics
  • Volume: 8
  • Issue Number: 3
  • Publisher: SPRINGER VERLAG HEIDELBERG
  • ISSN: 2192-4376
  • EISSN: 2192-4384
  • Serial URL: http://www.springerlink.com/content/2192-4376/

Subject/Index Terms

• TRT Terms: Container handling; Container on flat car; Container terminals; Heuristic methods; Linear programming; Loading and unloading; Terminal operations
• Subject Areas: Freight Transportation; Operations and Traffic Management; Railroads; Terminals and Facilities;

Filing Info

• Accession Number: 01719809
• Record Type: Publication
• Files: TRIS
• Created Date: Oct 22 2019 2:38PM