Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard
From MaRDI portal
Publication:2783826
DOI10.1287/trsc.32.4.370zbMath0987.90505OpenAlexW2097899745MaRDI QIDQ2783826
Publication date: 17 April 2002
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.32.4.370
Related Items
Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards ⋮ The airline container loading problem with pickup and delivery ⋮ Determining crane areas in intermodal transshipment yards: the yard partition problem ⋮ Model and algorithm for container allocation problem with random freight demands in synchromodal transportation ⋮ Allocation of empty containers between multi-ports ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ Positioning of loading units in a transshipment yard storage area ⋮ New bounds and algorithms for the transshipment yard scheduling problem ⋮ Towards the improvement of a combined transport chain performance. ⋮ Capacity allocation problem with random demands for the rail container carrier ⋮ An integrated model for the transshipment yard scheduling problem ⋮ Optimized load planning of trains in intermodal transportation ⋮ How to park freight trains on rail-rail transshipment yards: the train location problem ⋮ Opportunities for OR in intermodal freight transport research: A review. ⋮ Optimised loading patterns for intermodal trains ⋮ An assignment model for dynamic load planning of intermodal trains ⋮ Service Design Models for Rail Intermodel Transportation ⋮ Transshipment of containers at a container terminal: An overview
Uses Software
