IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v57y2009i2p456-467.html
   My bibliography  Save this article

Scheduling of Container Storage and Retrieval

Author

Listed:
  • Iris F. A. Vis

    (Faculty of Economics and Business Administration, VU University Amsterdam, 1081 HV Amsterdam, The Netherlands)

  • Kees Jan Roodbergen

    (Rotterdam School of Management, Erasmus University, 3000 DR Rotterdam, The Netherlands)

Abstract

We consider the problem of scheduling the storage and retrieval of containers in the storage area of a container terminal. Some arcs in the underlying directed network must be visited; other arcs may be---but need not be---visited. We can, therefore, consider this problem to be a special case of the directed rural postman problem. We show that this problem can be reformulated as an asymmetric Steiner traveling salesman problem. This reformulation can be efficiently solved to optimality by a combination of optimal assignments in bipartite networks for parts of the problem and dynamic programming for the connections between those parts.

Suggested Citation

  • Iris F. A. Vis & Kees Jan Roodbergen, 2009. "Scheduling of Container Storage and Retrieval," Operations Research, INFORMS, vol. 57(2), pages 456-467, April.
    • Handle: RePEc:inm:oropre:v:57:y:2009:i:2:p:456-467
    DOI: 10.1287/opre.1080.0621
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1080.0621
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1080.0621?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kim, Kap Hwan & Lee, Keung Mo & Hwang, Hark, 2003. "Sequencing delivery and receiving operations for yard cranes in port container terminals," International Journal of Production Economics, Elsevier, vol. 84(3), pages 283-292, June.
    2. Sundararajan Arunapuram & Kamlesh Mathur & Daniel Solow, 2003. "Vehicle Routing and Scheduling with Full Truckloads," Transportation Science, INFORMS, vol. 37(2), pages 170-182, May.
    3. Kap Hwan Kim & Ki Young Kim, 1999. "An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals," Transportation Science, INFORMS, vol. 33(1), pages 17-33, February.
    4. H. Donald Ratliff & Arnon S. Rosenthal, 1983. "Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem," Operations Research, INFORMS, vol. 31(3), pages 507-521, June.
    5. Lawrence Bodin & Aristide Mingozzi & Roberto Baldacci & Michael Ball, 2000. "The Rollon–Rolloff Vehicle Routing Problem," Transportation Science, INFORMS, vol. 34(3), pages 271-288, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Escudero-Santana, Alejandro & Muñuzuri, Jesús & Cortés, Pablo & Onieva, Luis, 2021. "The one container drayage problem with soft time windows," Research in Transportation Economics, Elsevier, vol. 90(C).
    2. Jennifer A. Pazour & Lucas C. Neubert, 2013. "Routing and Scheduling of Cross-Town Drayage Operations at J.B. Hunt Transport," Interfaces, INFORMS, vol. 43(2), pages 117-129, April.
    3. Dirk Briskorn & Florian Jaehn & Andreas Wiehl, 2019. "A generator for test instances of scheduling problems concerning cranes in transshipment terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 45-69, March.
    4. Iris F. A. Vis & Hector J. Carlo, 2010. "Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal," Transportation Science, INFORMS, vol. 44(2), pages 169-182, May.
    5. Zhou, Chenhao & Lee, Byung Kwon & Li, Haobin, 2020. "Integrated optimization on yard crane scheduling and vehicle positioning at container yards," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    6. A. Scholz & G. Wäscher, 2017. "Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 491-520, June.
    7. Ehleiter, Anne & Jaehn, Florian, 2016. "Housekeeping: Foresightful container repositioning," International Journal of Production Economics, Elsevier, vol. 179(C), pages 203-211.
    8. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    9. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    10. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    11. Atashi Khoei, Arsham & Süral, Haldun & Tural, Mustafa Kemal, 2023. "Energy minimizing order picker forklift routing problem," European Journal of Operational Research, Elsevier, vol. 307(2), pages 604-626.
    12. AERTS, Babiche & CORNELISSENS, Trijntje & SÖRENSEN, Kenneth, 2020. "Solving the joint order batching and picker routing problem, as a clustered vehicle routing problem," Working Papers 2020003, University of Antwerp, Faculty of Business and Economics.
    13. Yu, M. & de Koster, M.B.M., 2007. "Performance Approximation and Design of Pick-and-Pass Order Picking Systems," ERIM Report Series Research in Management ERS-2007-082-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    14. Grzegorz Tarczyński, 2012. "Analysis of the impact of storage parameters and the size of orders on the choice of the method for routing order picking," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 22(4), pages 105-120.
    15. Laura Lüke & André Hessenius & Stefan Irnich, 2025. "A Linear-Size Model for the Single Picker Routing Problem with Scattered Storage," Working Papers 2502, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    16. Mingyue Shao & Dongxu Chen & Xiaolong Lu & Xuefei Liu & Zhongzhen Yang, 2023. "Does Drop and Pull Transport Have a Chance? The Case of China," Sustainability, MDPI, vol. 15(13), pages 1-20, June.
    17. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "Graph reduction for the planar Travelling Salesman Problem," Research Memorandum 004, Maastricht University, Graduate School of Business and Economics (GSBE).
    18. Xi Guo & Shell Ying Huang, 2012. "Dynamic Space and Time Partitioning for Yard Crane Workload Management in Container Terminals," Transportation Science, INFORMS, vol. 46(1), pages 134-148, February.
    19. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.
    20. Hong, Soondo & Johnson, Andrew L. & Peters, Brett A., 2012. "Batch picking in narrow-aisle order picking systems with consideration for picker blocking," European Journal of Operational Research, Elsevier, vol. 221(3), pages 557-570.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:57:y:2009:i:2:p:456-467. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.