A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations

DOI10.1016/J.EJOR.2017.11.053MaRDI QIDQ723924zbMATH OpenOpenAlexFDO

Authors Virgile Galle, Cynthia Barnhart, Patrick Jaillet

Publication date 25 July 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1721.1/134861

zbMATH Keywords

combinatorial optimizationinteger programmingcontainer relocation problemblock relocation problemor in maritime industry

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• On the integer programming formulation for the relaxed restricted container relocation problem
• A mathematical formulation and efficient heuristics for the dynamic container relocation problem
• An exact approach to the restricted block relocation problem based on a new integer programming formulation
• An improved mathematical formulation for the blocks relocation problem
• A branch-and-cut algorithm for the restricted block relocation problem

Cites work

• A heuristic for retrieving containers from a yard
• A mathematical formulation and complexity considerations for the blocks relocation problem
• A mathematical formulation and efficient heuristics for the dynamic container relocation problem
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
• A tree search procedure for the container relocation problem
• An improved mathematical formulation for the blocks relocation problem
• Container relocation problem with time windows for container departure
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Models and algorithms for shuffling problems in steel plants
• New insights on the block relocation problem
• On the abstraction method for the container relocation problem
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• Storage yard operations in container terminals: literature overview, trends, and research directions
• The assignment of storage locations to containers for a container stack

Cited in

(14)

• On the integer programming formulation for the relaxed restricted container relocation problem
• The parallel stack loading problem of minimizing the exact number of relocations
• A local-search based heuristic for the unrestricted block relocation problem
• A new effective unified model for solving the pre-marshalling and block relocation problems
• Yard crane scheduling for container storage, retrieval, and relocation
• The block relocation problem with appointment scheduling
• An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
• Mathematical formulation and heuristic algorithm for the block relocation and loading problem
• Optimization of partially ordered container relocation problem with rolled containers
• A new modeling approach for the unrestricted block relocation problem
• A branch-and-cut algorithm for the restricted block relocation problem
• Approximate dynamic programming for container stacking
• An exact approach to the restricted block relocation problem based on a new integer programming formulation
• An exact algorithm for the block relocation problem with a stowage plan

Describes a project that uses

Uses Software

• BRP

This page was built for publication: A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723924)