Skip to main content
SpringerLink
Log in

The impact of time windows constraints on metaheuristics implementation: a study for the Discrete and Dynamic Berth Allocation Problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

A Publisher Correction to this article was published on 20 June 2021

This article has been updated

Abstract

This paper describes the development of a mechanism to deal with time windows constraints. To the best of our knowledge, the time windows constraints are difficult to be fulfilled even for state-of-the-art methods. Therefore, the main contribution of this paper is to propose a new computational technique to deal with such constraints. Such technique was tested combined with two metaheuristics to solve the discrete and dynamic Berth Allocation Problem. The technique ensures obtaining feasible solutions in terms of vessels time windows constraints, which are treated as hard constraints. A data set generator was created, resulting in a diversity of problems in terms of time windows constraints. A detailed computational analysis was carried out to compare the performance of both metaheuristics considering the technique.

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

Similar content being viewed by others

Change history

References

  1. Agra A, Oliveira M (2018) Mip approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur J Oper Res 264(1):138–148

    Article  MathSciNet  Google Scholar 

  2. Bäck T, Fogel DB, Michalewicz Z (2000) Evolutionary computation 1: basic algorithms and operators, vol 1. CRC press

  3. Bäck T, Fogel DB, Michalewicz Z (2000) Evolutionary computation 2: advanced algorithms and operators, vol 1. CRC press

  4. Banks J (2005) Discrete event system simulation. Prentice Hall

  5. Barros VH, Costa TS, Oliveira AC, Lorena LA (2011) Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering 60(4):606–613

    Article  Google Scholar 

  6. Buhrkal K, Zuglian S, Ropke S, Larsen J, Lusby R (2011) Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E: Logistics and Transportation Review 47(4):461–473

    Article  Google Scholar 

  7. Cahyono RT, Flonk EJ, Jayawardhana B (2019) Discrete-event systems modeling and the model predictive allocation algorithm for integrated berth and quay crane allocation. IEEE Trans Intell Transp Syst 21 (3):1321–1331

    Article  Google Scholar 

  8. Correcher JF, Alvarez-Valdes R (2017) A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem. Expert Syst Appl 89:112–128

    Article  Google Scholar 

  9. Correcher JF, Van den Bossche T, Alvarez-Valdes R, Berghe GV (2019) The berth allocation problem in terminals with irregular layouts. Eur J Oper Res 272(3):1096–1108

    Article  MathSciNet  Google Scholar 

  10. Du KL, Swamy MNS (2016) Particle swarm optimization. Springer International Publishing, Cham

    Google Scholar 

  11. Du Y, Chen Q, Lam JSL, Xu Y, Cao JX (2015) Modeling the impacts of tides and the virtual arrival policy in berth allocation. Transp Sci 49(4):939–956

    Article  Google Scholar 

  12. Eberhart, Shi Y (2001) Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 congress on evolutionary computation (IEEE Cat.No.01TH8546). vol 1, pp 81–86

  13. Eberhart RC, Shi Y (1998) Comparison between genetic algorithms and particle swarm optimization. Springer Berlin Heidelberg

  14. Frojan P, Correcher JF, Alvarez-Valdes R, Koulouris G, Tamarit JM (2015) The continuous berth allocation problem in a container terminal with multiple quays. Expert Syst Appl 42(21):7356–7366

    Article  Google Scholar 

  15. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, 1 edn. Addison-Wesley, Reading

    Google Scholar 

  16. Hsu HP (2016) A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously. Swarm and Evolutionary Computation 27:156–168

    Article  Google Scholar 

  17. Hsu HP, Wang CN (2020) Resources planning for container terminal in a maritime supply chain using multiple particle swarms optimization (mpso). Mathematics 8(5):764

    Article  Google Scholar 

  18. Jos BC, Harimanikandan M, Rajendran C, Ziegler H (2019) Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models. Sadhana 44(6):149

    Article  Google Scholar 

  19. Kavoosi M, Dulebenets MA, Abioye O, Pasha J, Theophilus O, Wang H, Kampmann R, Mikijeljevic M (2019) Berth scheduling at marine container terminals: a universal island-based metaheuristic approach. Maritime Business Review 5:1

    Article  Google Scholar 

  20. Lalla-Ruiz E, González-Velarde JL, Melián-Batista B, Moreno-Vega JM (2014) Biased random key genetic algorithm for the tactical berth allocation problem. Appl Soft Comput 22:60–76

    Article  Google Scholar 

  21. Lin SW, Ting CJ, Wu KC (2018) Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem. Flex Serv Manuf J 30(4):740–763

    Article  Google Scholar 

  22. Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp Sci 47(2):131–147

    Article  Google Scholar 

  23. Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, Berlin

    Book  Google Scholar 

  24. Nishi T, Okura T, Lalla-Ruiz E, Voß S (2020) A dynamic programming-based matheuristic for the dynamic berth allocation problem. Annals Oper Res 286(1):391–410

    Article  MathSciNet  Google Scholar 

  25. Raa B, Dullaert W, Schaeren RV (2011) An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Syst Appl 38(11):14136–14147

    Google Scholar 

  26. Silva E, Oliveira JF, Wascher G (2014) 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems. Eur J Oper Res 237(3):846–856

    Article  MathSciNet  Google Scholar 

  27. Tavakkoli-Moghaddam R, Fatemi-Anaraki S, Abdolhamidi D, Vahedi-Nouri B (2019) Integrated waterway scheduling, berth allocation and quay crane assignment problem by using a hybrid flow shop concept. In: 2019 international conference on industrial engineering and systems management (IESM). IEEE, pp 1–5

  28. Ting CJ, Wu KC, Chou H (2014) Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications 41(4, Part 1):1543–1550

    Article  Google Scholar 

  29. UNCTAD (2016) United nations conference on trade and development - review of maritime transport

Download references

Author information

Authors and Affiliations

  1. Faculdade de Engenharia da Universidade do Porto, Porto, Portugal

    Flávia Barbosa

  2. Faculdade de Ciências Aplicadas, Universidade Estadual de Campinas, Limeira, Brazil

    Priscila C. Berbert Rampazzo & Anibal Tavares de Azevedo

  3. Faculdade de Engenharia Elétrica e Computação, Universidade Estadual de Campinas, Campinas, Brazil

    Akebo Yamakami

Authors
  1. Flávia Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Priscila C. Berbert Rampazzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anibal Tavares de Azevedo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Akebo Yamakami
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flávia Barbosa.

Additional information

Publisher’s note

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

The original online version of this article was revised: the manuscript materials used was incorrect.

Appendices

Appendix A: Results from the computational tests using CPLEX

Table 5 Instances tests analysis
Full size table

Appendix B: Results from the computational tests using the metaheuristics

Table 6 Comparison results
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Barbosa, F., Rampazzo, P.C.B., de Azevedo, A. et al. The impact of time windows constraints on metaheuristics implementation: a study for the Discrete and Dynamic Berth Allocation Problem. Appl Intell 52, 1406–1434 (2022). https://doi.org/10.1007/s10489-021-02420-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02420-4

Keywords

Search

Navigation