Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm-Reference-Cited by-同舟云学术

Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm

Published:2018-01 Issue:1 Volume:264 Page:165-180
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Tanaka Shunji^ORCID,Tierney Kevin^ORCID

Funder

JSPS

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference41 articles.

1. ASlib: A benchmark library for algorithm selection;Bischl;Artificial Intelligence,2016

2. A tree search procedure for the container pre-marshalling problem;Bortfeldt;European Journal of Operational Research,2012

3. A generalized classification scheme for crane scheduling with interference;Boysen;European Journal of Operational Research,2017

4. A branch and price procedure for the container premarshalling problem;van Brink,2014

5. Container rehandling at maritime container terminals;Caserta,2011

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Container Pre-Marshaling Problem with Uncertain Intra-Group Retrievals;Asia-Pacific Journal of Operational Research;2024-07-20

2. The container premarshalling problem under limited crane time: A constraint programming approach;Computers & Operations Research;2024-06

3. Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions;European Journal of Operational Research;2024-03

4. A two‐stage solution method for the design problem of medium‐thick plates in steel plants;IET Collaborative Intelligent Manufacturing;2024-01-13

5. A fill-and-reduce greedy algorithm for the container pre-marshalling problem;Operational Research;2023-07-29