Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
DOI10.1016/J.COR.2014.06.018zbMATH Open1348.90249OpenAlexW2000194407WikidataQ125739974 ScholiaQ125739974MaRDI QIDQ337182FDOQ337182
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
Recommendations
- Routing two stacking cranes with predetermined container sequences
- The assignment of storage locations to containers for a container stack
- Optimizing container movements using one and two automated stacking cranes
- A hybrid ant colony and simulated annealing algorithm to solve the container stacking problem at seaport terminal
- An optimization model for the container pre-marshalling problem
combinatorial optimizationcrane schedulingcontainer stackingmixed integer programstacker crane problem
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- A crane scheduling method for port container terminals
- Integer Programming Formulation of Traveling Salesman Problems
- A New Formulation for the Travelling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- Container terminal operation and operations research -- a classification and literature review
- Operations research at container terminals: a literature update
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- A tree search procedure for the container relocation problem
- Applying the corridor method to a blocks relocation problem
- An optimization approach for planning daily drayage operations
- Scheduling aircraft landings -- the static case
- Minimizing total completion time subject to release dates and sequence-dependent processing times
- Heuristic and exact algorithms for scheduling aircraft landings
- 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
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- Integer linear programming formulations of multiple salesman problems and its variations
- Generalized traveling salesman problem reduction algorithms
- Are stacker crane problems easy? A statistical study
- Scheduling tasks with sequence-dependent processing times
Cited In (7)
- Robust optimization for premarshalling with uncertain priority classes
- The stacker crane problem and the directed general routing problem
- A feasibility-based heuristic for the container pre-marshalling problem
- On Rearrangement of Items Stored in Stacks
- Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches
- Approximate dynamic programming for container stacking
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
Uses Software
This page was built for publication: Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337182)
