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

DOI10.1016/J.COR.2014.06.018MaRDI QIDQ337182zbMATH OpenOpenAlexWikidataFDO

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

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

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

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

Cites work

• A New Formulation for the Travelling Salesman Problem
• A crane scheduling method for port container terminals
• A tree search procedure for the container relocation problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• An optimization approach for planning daily drayage operations
• Applying the corridor method to a blocks relocation problem
• Are stacker crane problems easy? A statistical study
• Computational Experience with an M-Salesman Traveling Salesman Algorithm
• Container terminal operation and operations research -- a classification and literature review
• Generalized traveling salesman problem reduction algorithms
• Heuristic and exact algorithms for scheduling aircraft landings
• Integer Programming Formulation of Traveling Salesman Problems
• Integer linear programming formulations of multiple salesman problems and its variations
• 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
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Operations research at container terminals: a literature update
• Scheduling aircraft landings -- the static case
• Scheduling tasks with sequence-dependent processing times
• Solution of a Large-Scale Traveling-Salesman Problem
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Cited in

(8)

• Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
• Approximate dynamic programming for container stacking
• Robust optimization for premarshalling with uncertain priority classes
• The stacker crane problem and the directed general routing problem
• On rearrangement of items stored in stacks
• A hybrid ant colony and simulated annealing algorithm to solve the container stacking problem at seaport terminal
• A feasibility-based heuristic for the container pre-marshalling problem

Describes a project that uses

Uses Software

• BRP

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)