Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations

DOI10.1016/j.cor.2014.06.018zbMath1348.90249OpenAlexW2000194407WikidataQ125739974 ScholiaQ125739974MaRDI QIDQ337182

Narayan Rangaraj, Andreas T. Ernst, Mohan Krishnamoorthy, Niraj Ramesh Dayama, Vishnu Narayanan

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.018

zbMATH Keywords

combinatorial optimizationcrane schedulingcontainer stackingmixed integer programstacker crane problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Robust optimization for premarshalling with uncertain priority classes ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ A feasibility-based heuristic for the container pre-marshalling problem ⋮ On Rearrangement of Items Stored in Stacks

Uses Software

• BRP

Cites Work

• Unnamed Item
• Unnamed Item
• Are stacker crane problems easy? A statistical study
• Applying the corridor method to a blocks relocation problem
• An optimization approach for planning daily drayage operations
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• Minimizing total completion time subject to release dates and sequence-dependent processing times
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• Container terminal operation and operations research -- a classification and literature review
• A tree search procedure for the container relocation problem
• A crane scheduling method for port container terminals
• Operations research at container terminals: a literature update
• Integer linear programming formulations of multiple salesman problems and its variations
• Scheduling Aircraft Landings—The Static Case
• Integer Programming Formulation of Traveling Salesman Problems
• A New Formulation for the Travelling Salesman Problem
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Scheduling tasks with sequence-dependent processing times
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Solution of a Large-Scale Traveling-Salesman Problem
• Computational Experience with an M-Salesman Traveling Salesman Algorithm

This page was built for publication: Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations