Skip to main content

A Disjunctive Graph Solution Representation for the Continuous and Dynamic Berth Allocation Problem

  • Conference paper
  • First Online:
Metaheuristics (MIC 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14754))

Included in the following conference series:

  • 224 Accesses

Abstract

In this paper, the continuous and dynamic Berth Allocation Problem is studied to minimize the makespan. A disjunctive graph solution representation is proposed as an alternative to the widely used sequence-based representation. Novel local search algorithms are proposed for the studied problem and embedded in an Iterated Local Search metaheuristic. Numerical tests are carried out on randomly generated instances to compare the two solution representation approaches with the results showing that the proposed approach can be successfully deployed to provide good quality solutions for instances of the problem.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615–627 (2010)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Carlo, H. J., Vis, I. F. A., Roodbergen, K. J.: Seaside operations in container terminals: Literature overview, trends, and research directions. Flexible Services and Manufacturing Journal, 1–39 (2013)

    Google Scholar 

  4. Guan, Y., Cheung, R.K.: The berth allocation problem: models and solution methods. OR Spectr. 26(1), 75–92 (2004). https://doi.org/10.1007/s00291-003-0140-8

    Article  MathSciNet  Google Scholar 

  5. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 57–97. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91086-4_3

    Chapter  Google Scholar 

  6. Imai, A., Nishimura, E., Papadimitriou, S.: The dynamic berth allocation problem for a container port. Transp. Res. Part B: Methodol. 35(4), 401–417 (2001)

    Article  Google Scholar 

  7. Imai, A., Sun, X., Nishimura, E., Papadimitriou, S.: Berth allocation in a container port: using a continuous location space approach. Transp. Res. Part B: Methodol. 39(3), 199–221 (2005)

    Article  Google Scholar 

  8. Lee, D.-H., Chen, J.H., Cao, J.X.: The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp. Res. Part E: Logist. Transp. Rev. 46(6), 1017–1029 (2010)

    Article  Google Scholar 

  9. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 129–168. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91086-4_5

    Chapter  Google Scholar 

  10. Meisel, F., Bierwirth, C.: Heuristics for the integration of crane productivity in the berth allocation problem. Trans. Res. Part E: Log. and Trans. Rev. 45(1), 196–209 (2009)

    Google Scholar 

  11. Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manage. Sci. 42(6), 797–813 (1996)

    Article  Google Scholar 

  12. Roy, B., Sussmann, B.: Les problèmes d'ordonnancement avec constraintes disjonctives, SEMA, Note D.S., No. 9 (1964)

    Google Scholar 

  13. Wang, F., Lim, A.: A stochastic beam search for the berth allocation problem. Decis. Support. Syst. 42(4), 2186–2196 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nikolay Tchernev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cheimanoff, N., Féniès, P., Kitri, M.N., Tchernev, N. (2024). A Disjunctive Graph Solution Representation for the Continuous and Dynamic Berth Allocation Problem. In: Sevaux, M., Olteanu, AL., Pardo, E.G., Sifaleras, A., Makboul, S. (eds) Metaheuristics. MIC 2024. Lecture Notes in Computer Science, vol 14754. Springer, Cham. https://doi.org/10.1007/978-3-031-62922-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-62922-8_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-62921-1

  • Online ISBN: 978-3-031-62922-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics