Skip to main content
SpringerLink
Log in

An Adaptive Island Evolutionary Algorithm for the berth scheduling problem

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Increasing volumes of the seaborne containerized trade put additional pressure on marine container terminal operators. Long congestion periods have been reported at certain marine container terminals due to inability of the infrastructure to serve the growing demand, increasing number of megaships, port disruptions, and other factors. In order to alleviate congestion and avoid potential cargo delivery delays to the end customers, marine container terminal operators have to enhance the efficiency of their operations. This study focuses on improving the seaside operations at marine container terminals. A new Adaptive Island Evolutionary Algorithm is proposed for the berth scheduling problem, aiming to minimize the total weighted service cost of vessels. The developed algorithm simultaneously executes separate Evolutionary Algorithms in parallel on its islands and exchanges individuals between the islands based on an adaptive mechanism, which allows more efficient exploration of the problem search space. A set of extensive computational experiments indicate that the optimality gaps of the Adaptive Island Evolutionary Algorithm do not exceed 1.93% for the considered small-size problem instances. Furthermore, the proposed solution algorithm was compared against the other state-of-the-art metaheuristic algorithms and exhibited statistically significant improvements in terms of the objective function values.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. UNCTAD (2017) Review of maritime transport 2017. United Nations Conference on Trade and Development, New York

    Google Scholar 

  2. Journal of Commerce (2015) Largest container ships on order to rise 13 percent by 2020. www.joc.com. Accessed 06 Jan 2018

  3. Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244(3):675–689

    Article  MathSciNet  Google Scholar 

  4. Dadashi A, Dulebenets MA, Golias MM, Sheikholeslami A (2017) A novel continuous berth scheduling model at multiple marine container terminals with tidal considerations. Marit Bus Rev 2(2):142–157

    Article  Google Scholar 

  5. Golias M, Portal MI, Konur D, Kaisar E, Kolomvos G (2014) Robust berth scheduling at marine container terminals via hierarchical optimization. Comput Oper Res 41:412–422

    Article  MathSciNet  Google Scholar 

  6. Frojan P, Correcher J, Alvarez-Valdes R, Koulouris G, Tamarit J (2015) The continuous Berth Allocation Problem in a container terminal with multiple quays. Expert Syst Appl 42(21):7356–7366

    Article  Google Scholar 

  7. Dulebenets MA (2017) A novel memetic algorithm with a deterministic parameter control for efficient berth scheduling at marine container terminals. Marit Bus Rev 2(4):302–330

    Article  Google Scholar 

  8. Dulebenets MA (2018) Application of evolutionary computation for berth scheduling at marine container terminals: parameter tuning versus parameter control. IEEE Trans Intell Transp Syst 19(1):25–37

    Article  Google Scholar 

  9. Dulebenets MA, Kavoosi M, Abioye OF, Pasha J (2018) A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control. Algorithms 11(7):1–35

    Article  MathSciNet  Google Scholar 

  10. Dulebenets MA, Moses R, Ozguven EE, Vanli A (2017) Minimizing carbon dioxide emissions due to container handling at marine container terminals via hybrid evolutionary algorithms. IEEE Access 5:8131–8147

    Article  Google Scholar 

  11. Imai A, Nishimura E, Paradimitriou S (2008) Berthing ships at a multi-user container terminal with a limited quay capacity. Transp Res Part E 44(1):136–151

    Article  Google Scholar 

  12. Dulebenets MA, Golias M, Mishra S (2018) A collaborative agreement for berth allocation under excessive demand. Eng Appl Artif Intell 69:76–92

    Article  Google Scholar 

  13. Karafa J, Golias M, Ivey S, Saharidis G, Leonardos N (2013) The berth allocation problem with stochastic vessel handling times. Int J Adv Manuf Technol 65(1–4):473–484

    Article  Google Scholar 

  14. Hu Z (2015) Multi-objective genetic algorithm for berth allocation problem considering daytime preference. Comput Ind Eng 89:2–14

    Article  Google Scholar 

  15. Xu Y, Chen Q, Quan X (2011) Robust berth scheduling with uncertain vessel delay and handling time. Ann Oper Res 192(1):123–140

    Article  MathSciNet  Google Scholar 

  16. Emde S, Boysen N (2016) Berth allocation in container terminals that service feeder ships and deep-sea vessels. J Oper Res Soc 67(4):551–563

    Article  Google Scholar 

  17. Lee D, Chen J, Cao J (2010) The continuous Berth Allocation Problem: a greedy randomized adaptive search solution. Transp Res Part E 46(6):1017–1029

    Article  Google Scholar 

  18. Cordeau J, Laporte G, Legato P, Moccia L (2005) Models and Tabu Search heuristics for the berth allocation problem. Transp Sci 39(4):526–538

    Article  Google Scholar 

  19. Lalla-Ruiz E, Melian-Batista B, Moreno-Vega J (2012) Artificial intelligence hybrid heuristic based on Tabu search for the dynamic berth allocation problem. Eng Appl Artif Intell 25(6):1132–1141

    Article  Google Scholar 

  20. Imai A, Yamakawa Y, Huang K (2014) The strategic berth template problem. Transp Res Part E 72:77–100

    Article  Google Scholar 

  21. Cheong C, Tan K (2008) A multi-objective multi-colony ant algorithm for solving the berth allocation problem. Stud Comput Intell 116(333–350):16

    Google Scholar 

  22. Hansen P, Oguz C, Mladenovic N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3):636–649

    Article  Google Scholar 

  23. Mauri G, Ribeiro G, Lorena L, Laporte G (2016) An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Comput Oper Res 70:140–154

    Article  MathSciNet  Google Scholar 

  24. Eiben AE, Smith JE (2015) Introduction to evolutionary computing. Springer, Berlin

    Book  Google Scholar 

  25. Dulebenets MA (2018) Green vessel scheduling in liner shipping: modeling carbon dioxide emission costs in sea and at ports of call. Int J Transp Sci Technol 7(1):26–44

    Article  Google Scholar 

  26. Dulebenets MA (2018) A comprehensive multi-objective optimization model for the vessel scheduling problem in liner shipping. Int J Prod Econ 196:293–318

    Article  Google Scholar 

  27. Dulebenets MA (2019) Minimizing the total liner shipping route service costs via application of an efficient collaborative agreement. IEEE Trans Intell Transp Syst 20(1):123–136

    Article  Google Scholar 

  28. Jakob W (2010) A general cost-benefit-based adaptation framework for multimeme algorithms. Memet Comput 2(3):201–218

    Article  Google Scholar 

  29. Muthuswamy S, Lam S (2011) Discrete particle swarm optimization for the team orienteering problem. Memet Comput 3(4):287–303

    Article  Google Scholar 

  30. LaTorre A, Muelas S, Peña J (2013) Evaluating the multiple offspring sampling framework on complex continuous optimization functions. Memet Comput 5(4):295–309

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Civil and Environmental Engineering, Florida A&M University-Florida State University, 2525 Pottsdamer Street, Building A, Suite A124, Tallahassee, FL, 32310-6046, USA

    Maxim A. Dulebenets

Authors
  1. Maxim A. Dulebenets
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maxim A. Dulebenets.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dulebenets, M.A. An Adaptive Island Evolutionary Algorithm for the berth scheduling problem. Memetic Comp. 12, 51–72 (2020). https://doi.org/10.1007/s12293-019-00292-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-019-00292-3

Keywords

Search

Navigation