POPMUSIC as a matheuristic for the berth allocation problem | Annals of Mathematics and Artificial Intelligence Skip to main content
Springer Nature Link
Log in

POPMUSIC as a matheuristic for the berth allocation problem

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. In order to address it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programming formulation. POPMUSIC is an efficient metaheuristic that may serve as blueprint for matheuristics approaches once hybridized with mathematical programming. In this regard, the use of exact methods for solving the sub-problems defined in the POPMUSIC template highlight an interoperation between metaheuristics and mathematical programming techniques, which provide a new type of approach for this problem. The computational experiments reveal excellent results.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Alvim, A., Taillard, E.: Popmusic for the world location-routing problem. Eur. J. Oper. Res. 2(3), 231–254 (2013). doi:10.1007/s13676-013-0024-2

    Google Scholar 

  2. Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202, 615–627 (2010). doi:10.1016/j.ejor.2009.05.031

    Article  MathSciNet  MATH  Google Scholar 

  3. Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R.: Models for the discrete berth allocation problem: a computational comparison. Transp. Res. E 47, 461–473 (2011). doi:10.1016/j.tre.2010.11.016

    Article  Google Scholar 

  4. Christensen, C., Holst, C.: Berth allocation in container terminals. Master’s thesis, Technical University of Denmark (2008)

  5. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Chapter 4. Maritime transportation. In: C. Barnhart, G. Laporte (eds.) Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 189–284. Elsevier (2007), doi:10.1016/S0927-0507(06)14004-9

  6. Cordeau, J., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 39, 526–538 (2005). doi:10.1287/trsc.1050.0120

    Article  Google Scholar 

  7. Cordeau, J.F., Gaudioso, M., Laporte, G., Moccia, L.: The service allocation problem at the Gioia Tauro maritime terminal. Eur. J. Oper. Res. 176(2), 1167–1184 (2007)

    Article  MATH  Google Scholar 

  8. Hoffarth, L., Voß, S.: Liegeplatzdisposition auf einem Container Terminal - Ansatze zur Entwicklung eines entscheidungsunterstützenden Systems̈. In: H. Dyckhoff, U. Derigs, M. Salomon, H. Tijms (eds.) Operations Research Proceedings 1993, pp. 89–95. Springer, Berlin (1994), doi:10.1007/978-3-642-78910-6_28

  9. Hu, Q.M., Hu, Z.H., Du, Y.: Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels. Comput. Ind. Eng. 70, 1–10 (2014). doi:10.1016/j.cie.2014.01.003

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  13. Lalla-Ruiz, E., Voß, S.: Towards a matheuristic approach for the berth allocation problem. Lect. Notes Comput. Sci 8426, 218–222 (2014)

    Article  Google Scholar 

  14. Li, B., Li, W.F., Voß, S.: Modeling container terminal scheduling systems as hybrid flow shops with blocking based on attributes. In: S. Voß, J. Pahl, S. Schwarze (eds.) , pp. 413–434. Physica, Heidelberg (2009)

  15. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics - Hybridizing Metaheuristics and Mathematical Programming. Ann. Inf. Syst., vol. 10. Springer, Berlin (2010)

  16. Meisel, F.: Seaside Operations Planning in Container Terminals. Contributions to Management Science. Physica, Heidelberg (2010)

    Google Scholar 

  17. Notteboom, T.: The time factor in liner shipping services. Marit. Econ. Logist. 8(1), 19–39 (2006)

    Article  Google Scholar 

  18. de Oliveira, R.M., Mauri, G.R., Lorena, L.A.N.: Clustering search for the berth allocation problem. Expert Syst. Appl. 39 (5), 5499–5505 (2012). doi:10.1016/j.eswa.2011.11.072

    Article  Google Scholar 

  19. Pei, J., Liu, X., Pardalos, P., Fan, W., Yang, S., Wang, L.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70 (1-4), 335–348 (2014). doi:10.1007/s00170-013-5263-8

    Article  Google Scholar 

  20. In: Resende, M., Pardalos, P. (eds.) : Handbook of Applied Optimization. Oxford University Press, Oxford (2002)

  21. Rodriguez-Molins, M., Ingolotti, L., Barber, F., Salido, M., Sierra, M., Puente, J.: A genetic algorithm for robust berth allocation and quay crane assignment. Prog. Artif. Intell., 1–16 (2014). doi:10.1007/s13748-014-0056-3

  22. Sniedovich, M., Voß, S.: The corridor method: a dynamic programming inspired metaheuristic. Control. Cybern. 35(3), 551–578 (2006) http://eudml.org/doc/ 209435

    MathSciNet  MATH  Google Scholar 

  23. Steenken, D., Voß, S., Stahlbock, R.: Container terminal operations and operations research – a classification and literature review. OR Spectrum 26, 3–49 (2004). doi:10.1007/s00291-003-0157-z

    Article  MATH  Google Scholar 

  24. Taillard, E., Voß, S.: POPMUSIC – partial optimization metaheuristic under special intensification conditions. In: C. Ribeiro, P. Hansen (eds.) Essays and Surveys in Metaheuristics, pp. 613–629. Kluwer, Boston (2002), doi:10.1007/978-1-4615-1507-4_27

  25. Ting, C.J., Wu, K.C., Chou, H.: Particle swarm optimization algorithm for the berth allocation problem. Expert Syst. Appl. 41(4), 1543–1550 (2014). doi:10.1016/j.eswa.2013.08.051

    Article  Google Scholar 

  26. Umang, N., Bierlaire, M., Vacca, I.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. E 54, 14–31 (2013). doi:10.1016/j.tre.2013.03.003

    Article  Google Scholar 

  27. Verstichel, J., Berghe, G.: A late acceptance algorithm for the lock scheduling problem. In: S. Voß, J. Pahl, S. Schwarze (eds.) Management, Logistik, pp. 457–478. Physica, Heidelberg (2009)

  28. Xiao, L., Hu, Z.H.: Berth allocation problem with quay crane assignment for container terminals based on rolling-horizon strategy. Math. Probl. Eng. 2014 (2014). doi:10.1155/2014/845752. Article ID 845752, 11 pages

  29. Zampelli, S., Vergados, Y., Schaeren, R., Dullaert, W., Raa, B.: The berth allocation and quay crane assignment problem using a CP approach. Lect. Notes Comput. Sci 8124, 880–896 (2013). doi:10.1007/978-3-642-40627-0_64

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Systems Engineering, University of La Laguna, La Laguna, Spain

    Eduardo Lalla-Ruiz

  2. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Stefan Voß

  3. Escuela de Ingeniería Industrial, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile

    Stefan Voß

Authors
  1. Eduardo Lalla-Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Voß.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lalla-Ruiz, E., Voß, S. POPMUSIC as a matheuristic for the berth allocation problem. Ann Math Artif Intell 76, 173–189 (2016). https://doi.org/10.1007/s10472-014-9444-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-014-9444-4

Keywords

Mathematics Subject Classification (2010)

Search

Navigation