TY - JOUR
T1 - New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports
AU - Dayama, Niraj Ramesh
AU - Ernst, Andreas
AU - Krishnamoorthy, Mohan
AU - Narayanan, Vishnu
AU - Rangaraj, Narayan
PY - 2017/12/1
Y1 - 2017/12/1
N2 - Whenever sets of objects are piled up in heaps, columns or stacks, any rearrangement of these objects requires substantial amount of time, effort and cost. In this paper, we study the problem of optimizing such “stack-rearrangement operations” when multiple similar objects or blocks need to be rearranged. We discuss the problem in the context of yard crane operations in maritime ports, where cargo containers are stored and fetched by yard cranes. We intend to minimize the crane operations that are required during container stack rearrangement by yard cranes. This paper defines the underlying abstract mathematical problem and proves its computational complexity. Thereafter, we propose suitable mathematical models for the problem and devise several (exact) approaches to solve it. We provide several families of new problem data instances and the prove the efficacy of our algorithms by doing extensive computational analysis over the data instances.
AB - Whenever sets of objects are piled up in heaps, columns or stacks, any rearrangement of these objects requires substantial amount of time, effort and cost. In this paper, we study the problem of optimizing such “stack-rearrangement operations” when multiple similar objects or blocks need to be rearranged. We discuss the problem in the context of yard crane operations in maritime ports, where cargo containers are stored and fetched by yard cranes. We intend to minimize the crane operations that are required during container stack rearrangement by yard cranes. This paper defines the underlying abstract mathematical problem and proves its computational complexity. Thereafter, we propose suitable mathematical models for the problem and devise several (exact) approaches to solve it. We provide several families of new problem data instances and the prove the efficacy of our algorithms by doing extensive computational analysis over the data instances.
KW - Combinatorial optimization
KW - Crane scheduling
KW - Container stacking
KW - Maritime ports
KW - Mixed integer program
UR - http://www.scopus.com/inward/record.url?scp=85064289107&partnerID=8YFLogxK
U2 - 10.1007/s13676-016-0098-8
DO - 10.1007/s13676-016-0098-8
M3 - Article
AN - SCOPUS:85064289107
VL - 6
SP - 307
EP - 348
JO - EURO Journal on Transportation and Logistics
JF - EURO Journal on Transportation and Logistics
SN - 2192-4376
IS - 4
ER -