An investigation of IDA* algorithms for the container relocation problem

DOI10.1007/978-3-642-13022-9_4MaRDI QIDQ3082798zbMATH OpenOpenAlexFDO

Authors Huidong Zhang, Songshan Guo, Wenbin Zhu, Andrew Lim, Brenda Cheang

Publication date 16 March 2011

Published in Trends in Applied Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13022-9_4

zbMATH Keywords

container relocation problemheuristicsIDA*

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On the abstraction method for the container relocation problem
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• Research on the model and heuristic algorithm of container relocation problem
• An exact algorithm for the block relocation problem with a stowage plan
• A mathematical formulation and efficient heuristics for the dynamic container relocation problem

Cited in

(5)

• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• Rational deployment of multiple heuristics in optimal state-space search
• An algorithm with performance guarantee for the online container relocation problem
• An improved mathematical formulation for the blocks relocation problem
• A new modeling approach for the unrestricted block relocation problem

This page was built for publication: An investigation of IDA* algorithms for the container relocation problem

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