An average-case asymptotic analysis of the container relocation problem

DOI10.1016/J.ORL.2016.08.006MaRDI QIDQ1709944zbMATH OpenOpenAlexDBLPWikidataFDO

Authors S. Borjian Boroujeni, Vahideh H. Manshadi, Virgile Galle, Cynthia Barnhart, Patrick Jaillet

Publication date 15 January 2019

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/118934

zbMATH Keywords

asymptotic analysisCRPexpected lower bound

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• An algorithm with performance guarantee for the online container relocation problem
• A mathematical formulation and efficient heuristics for the dynamic container relocation problem
• A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem
• Research on the model and heuristic algorithm of container relocation problem
• Solving the container relocation problem by an improved greedy look-ahead heuristic

Cites work

• A heuristic rule for relocating blocks
• A mathematical formulation and complexity considerations for the blocks relocation problem
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Operations research at container terminals: a literature update

Cited in

(5)

• Smart stacking for import containers using customer information at automated container terminals
• The block retrieval problem
• Yard crane scheduling for container storage, retrieval, and relocation
• An algorithm with performance guarantee for the online container relocation problem
• The block relocation problem with appointment scheduling

Describes a project that uses

Uses Software

• BRP

This page was built for publication: An average-case asymptotic analysis of the container relocation problem

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