Journal
OR SPECTRUM
Volume 32, Issue 3, Pages 427-452Publisher
SPRINGER
DOI: 10.1007/s00291-010-0203-6
Keywords
Container terminal; Layout; Yard layout; Resource constrained shortest path problem; Variable neighborhood descent
Categories
Funding
- German Research Foundation (DFG) [SU136/5-1]
Ask authors/readers for more resources
In this paper, we introduce an integer linear program for planning the layout of container yards. We concentrate on a special layout class of container yards which we call yard layout with transfer lanes. For those layouts typically rubber tired gantry cranes are used for stacking operations and trucks for horizontal transports. We show that the optimization model can be formulated as a special type of a resource constrained shortest path problem for which the LP relaxation always has at least one integer optimal solution. This model is restricted to a rectangular storage yard which allows a linear formulation. For an arbitrary shaped container yard we adopt the model and develop a variable neighborhood descent (VND) heuristic for solving non-rectangular instances. Concerning the rectangular case, we show that the VND heuristic achieves optimal solutions for 38% of the realistic test instances.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available