IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v202y2010i3p615-627.html
   My bibliography  Save this article

A survey of berth allocation and quay crane scheduling problems in container terminals

Author

Listed:
  • Bierwirth, Christian
  • Meisel, Frank

Abstract

Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.

Suggested Citation

  • Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
  • Handle: RePEc:eee:ejores:v:202:y:2010:i:3:p:615-627
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00357-9
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Imai, Akio & Sasaki, Kazuya & Nishimura, Etsuko & Papadimitriou, Stratos, 2006. "Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 373-389, June.
    2. Kim, Kap Hwan & Moon, Kyung Chan, 2003. "Berth scheduling by simulated annealing," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 541-560, July.
    3. Legato, Pasquale & Mazza, Rina M., 2001. "Berth planning and resources optimisation at a container terminal via discrete event simulation," European Journal of Operational Research, Elsevier, vol. 133(3), pages 537-547, September.
    4. Meisel, Frank & Bierwirth, Christian, 2009. "Heuristics for the integration of crane productivity in the berth allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 196-209, January.
    5. Goodchild, A.V. & Daganzo, C.F., 2007. "Crane double cycling in container ports: Planning methods and evaluation," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 875-891, October.
    6. Goodchild, Anne V. & Daganzo, Carlos F., 2005. "Crane Double Cycling in Container Ports: Affect on Ship Dwell Time," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9qp7p7jq, Institute of Transportation Studies, UC Berkeley.
    7. Peterkofsky, Roy I. & Daganzo, Carlos F., 1990. "A branch and bound solution method for the crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 159-172, June.
    8. Goodchild, A. V. & Daganzo, C. F., 2004. "Reducing Ship Turn-Around Time Using Double-Cycling," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt86r4p6sc, Institute of Transportation Studies, UC Berkeley.
    9. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2001. "The dynamic berth allocation problem for a container port," Transportation Research Part B: Methodological, Elsevier, vol. 35(4), pages 401-417, May.
    10. Hansen, Pierre & Oguz, Ceyda & Mladenovic, Nenad, 2008. "Variable neighborhood search for minimum cost berth allocation," European Journal of Operational Research, Elsevier, vol. 191(3), pages 636-649, December.
    11. Bish, Ebru K., 2003. "A multiple-crane-constrained scheduling problem in a container terminal," European Journal of Operational Research, Elsevier, vol. 144(1), pages 83-107, January.
    12. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2008. "Berthing ships at a multi-user container terminal with a limited quay capacity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(1), pages 136-151, January.
    13. Nishimura, Etsuko & Imai, Akio & Papadimitriou, Stratos, 2001. "Berth allocation planning in the public berth system by genetic algorithms," European Journal of Operational Research, Elsevier, vol. 131(2), pages 282-292, June.
    14. Akio Imai & Jin-Tao Zhang & Etsuko Nishimura & Stratos Papadimitriou, 2007. "The Berth Allocation Problem with Service Time and Delay Time Objectives," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 9(4), pages 269-290, December.
    15. Imai, Akio & Nishimura, Etsuko & Hattori, Masahiro & Papadimitriou, Stratos, 2007. "Berth allocation at indented berths for mega-containerships," European Journal of Operational Research, Elsevier, vol. 179(2), pages 579-593, June.
    16. Lokuge, Prasanna & Alahakoon, Damminda, 2007. "Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1985-2015, March.
    17. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    18. Daganzo, Carlos F., 1989. "The crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 23(3), pages 159-175, June.
    19. Branislav Dragović & Nam Kyu Park & Zoran Radmilović & Vladislav Maraš, 2005. "Simulation Modelling of Ship-Berth Link With Priority Service," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 7(4), pages 316-335, December.
    20. Vis, Iris F. A. & de Koster, Rene, 2003. "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, Elsevier, vol. 147(1), pages 1-16, May.
    21. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2003. "Berth allocation with service priority," Transportation Research Part B: Methodological, Elsevier, vol. 37(5), pages 437-457, June.
    22. Branislav Dragović & Nam Kyu Park & Zoran Radmilović, 2006. "Ship-berth link performance evaluation: simulation and analytical approaches," Maritime Policy & Management, Taylor & Francis Journals, vol. 33(3), pages 281-299, July.
    23. Imai, Akio & Chen, Hsieh Chia & Nishimura, Etsuko & Papadimitriou, Stratos, 2008. "The simultaneous berth and quay crane allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(5), pages 900-920, September.
    24. Imai, Akio & Sun, Xin & Nishimura, Etsuko & Papadimitriou, Stratos, 2005. "Berth allocation in a container port: using a continuous location space approach," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 199-221, March.
    25. Lee, Der-Horng & Wang, Hui Qiu & Miao, Lixin, 2008. "Quay crane scheduling with non-interference constraints in port container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(1), pages 124-135, January.
    26. Kim, Kap Hwan & Park, Young-Man, 2004. "A crane scheduling method for port container terminals," European Journal of Operational Research, Elsevier, vol. 156(3), pages 752-768, August.
    27. Meersmans, P.J.M. & Dekker, R., 2001. "Operations research supports container handling," Econometric Institute Research Papers EI 2001-22, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    Full references (including those not matched with items on IDEAS)

    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:eee:ejores:v:202:y:2010:i:3:p:615-627. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Haili He). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.