An average-case asymptotic analysis of the container relocation problem
DOI10.1016/J.ORL.2016.08.006zbMATH Open1408.90161DBLPjournals/orl/GalleBMBJ16OpenAlexW2512155725WikidataQ101123887 ScholiaQ101123887MaRDI QIDQ1709944FDOQ1709944
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
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
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
Cited In (5)
- Yard crane scheduling for container storage, retrieval, and relocation
- An algorithm with performance guarantee for the online container relocation problem
- Smart stacking for import containers using customer information at automated container terminals
- The block relocation problem with appointment scheduling
- The block retrieval problem
Uses Software
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)