Optimizing yard assignment in an automotive transshipment terminal
From MaRDI portal
Publication:421631
DOI10.1016/J.EJOR.2011.06.008zbMath1237.90131OpenAlexW2170961641MaRDI QIDQ421631
Gregorio Sorrentino, Luigi Moccia, Jean-François Cordeau, Gilbert Laporte
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.008
Related Items (6)
A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ An integrated model for berth and yard planning in container terminals with multi-continuous berth layout ⋮ A matheuristic approach to large-scale avionic scheduling ⋮ The piggyback transportation problem: transporting drones launched from a flying warehouse ⋮ Scheduling taxi services for a team of car relocators
Cites Work
- A general heuristic for vehicle routing problems
- A column generation heuristic for a dynamic generalized assignment problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Local search algorithms for the rectangle packing problem with general spatial costs
- Container terminal operation and operations research -- a classification and literature review
- Two-dimensional packing problems: a survey
- Transshipment of containers at a container terminal: An overview
- A scheduling method for Berth and Quay cranes
- Operations research at container terminals: a literature update
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- The management of transshipment terminals. Desicion support for terminal operations in finished vehicle supply chains.
This page was built for publication: Optimizing yard assignment in an automotive transshipment terminal
