IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2015y2015i1n781907.html

Migrating Birds Optimization for the Seaside Problems at Maritime Container Terminals

Author

Listed:
  • Eduardo Lalla-Ruiz
  • Christopher Expósito-Izquierdo
  • Jesica de Armas
  • Belén Melián-Batista
  • J. Marcos Moreno-Vega

Abstract

Sea freight transportation involves moving huge amounts of freights among maritime locations widely spaced by means of container vessels. The time required to serve container vessels is the most relevant indicator when assessing the competitiveness of a maritime container terminal. In this paper, two main logistic problems stemming from the transshipment of containers in the seaside of a maritime container terminal are addressed, namely, the Berth Allocation Problem aimed at allocating and scheduling incoming vessels into berthing positions along the quay and the Quay Crane Scheduling Problem, whose objective is to schedule the loading and unloading tasks associated with a container vessel. For solving them, two Migrating Birds Optimization (MBO) approaches are proposed. The MBO is a recently proposed nature‐inspired algorithm based on the V‐formation flight of migrating birds. In this algorithm, a set of solutions of the problem at hand, called birds, cooperate among themselves during the search process by sharing information within a V‐line formation. The computational experiments performed over well‐known problem instances reported in the literature show that the performance of our proposed MBO approaches is highly competitive and presents a better performance in terms of running time than the best approximate approach proposed in the literature.

Suggested Citation

  • Eduardo Lalla-Ruiz & Christopher Expósito-Izquierdo & Jesica de Armas & Belén Melián-Batista & J. Marcos Moreno-Vega, 2015. "Migrating Birds Optimization for the Seaside Problems at Maritime Container Terminals," Journal of Applied Mathematics, John Wiley & Sons, vol. 2015(1).
  • Handle: RePEc:wly:jnljam:v:2015:y:2015:i:1:n:781907
    DOI: 10.1155/2015/781907
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2015/781907
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/781907?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
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Daganzo, Carlos F., 1989. "The crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 23(3), pages 159-175, June.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dragović, Branislav & Dragović, Andro & Dulebenets, Maxim A., 2025. "The quay crane operation problem at marine container terminals: bibliometric analysis, emerging trends, and future research opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).

    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. Briskorn, Dirk & Drexl, Andreas & Hartmann, Sönke, 2005. "Inventory based dispatching of automated guided vehicles on container terminals," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 596, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. J Blazewicz & T C E Cheng & M Machowiak & C Oguz, 2011. "Berth and quay crane allocation: a moldable task scheduling model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1189-1197, July.
    3. 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.
    4. 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.
    5. Wang, Chong & Liu, Kaiyuan & Zhang, Canrong & Miao, Lixin, 2024. "Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
    6. Jiyin Liu & Yat‐wah Wan & Lei Wang, 2006. "Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 60-74, February.
    7. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
    8. Sun, Defeng & Tang, Lixin & Baldacci, Roberto, 2019. "A Benders decomposition-based framework for solving quay crane scheduling problems," European Journal of Operational Research, Elsevier, vol. 273(2), pages 504-515.
    9. 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.
    10. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    11. Wang, Chong & Wang, Qi & Xiang, Xi & Zhang, Canrong & Miao, Lixin, 2025. "Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 320(3), pages 593-615.
    12. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    13. Iris, Çağatay & Pacino, Dario & Ropke, Stefan & Larsen, Allan, 2015. "Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 75-97.
    14. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    15. Mao, Anjia & Yu, Tiantian & Ding, Zhaohao & Fang, Sidun & Guo, Jinran & Sheng, Qianqian, 2022. "Optimal scheduling for seaport integrated energy system considering flexible berth allocation," Applied Energy, Elsevier, vol. 308(C).
    16. Andrew Lim & Brian Rodrigues & Fei Xiao & Yi Zhu, 2004. "Crane scheduling with spatial constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 386-406, April.
    17. Haoqing Wang & Yan Liu & Yuquan Du & Shuaian Wang, 2025. "Optimal refund policy design for ship berthing appointment mechanism," Annals of Operations Research, Springer, vol. 347(3), pages 1643-1670, April.
    18. Wang, Shuaian, 2015. "Optimal sequence of container ships in a string," European Journal of Operational Research, Elsevier, vol. 246(3), pages 850-857.
    19. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    20. Berktas, Nihal & Zografos, Konstantinos G., 2025. "Generic model for capacity allocation on transportation terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 196(C).

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2015:y:2015:i:1:n:781907. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.