Skip to main content
SpringerLink
Log in

A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The goal of the berth allocation problem under time-dependent limitations is to assign and schedule incoming vessels to berthing positions taking into account tidal and water depth constraints. In order to solve this problem, we propose a POPMUSIC approach (Partial Optimization Metaheuristic Under Special Intensification Conditions) which includes the resolution of an appropriate mathematical programming formulation as an embedded procedure. This method is tested over realistic problem instances proposed in the literature. The computational experiments as well as the comparison with a reference algorithm for this problem reported in the related literature reveal that our approach is suitable to be used in real-world environments.

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

Similar content being viewed by others

Notes

  1. http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/.

References

  • Alvarez, J. F., Longva, T., & Engebrethsen, E. S. (2010). A methodology to assess vessel berthing and speed optimization policies. Maritime Economics and Logistics, 12, 327–346.

    Article  Google Scholar 

  • Alvim, A. C. F., & Taillard, É. D. (2009). POPMUSIC for the point feature label placement problem. European Journal of Operational Research, 192(2), 396–413.

    Article  Google Scholar 

  • Alvim, A. C. F., & Taillard, É. D. (2013). POPMUSIC for the world location-routing problem. EURO Journal on Transportation and Logistics, 2(3), 231–254.

    Article  Google Scholar 

  • Barros, V. H., Costa, T. S., Oliveira, A. C. M., & Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers and Industrial Engineering, 60(4), 606–613.

    Article  Google Scholar 

  • Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615–627.

    Article  Google Scholar 

  • Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675–689.

    Article  Google Scholar 

  • 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, 47(4), 461–473.

    Article  Google Scholar 

  • Cariou, P. (2011). Is slow steaming a sustainable means of reducing \(\text{ CO }_2\) emissions from container shipping? Transportation Research Part D: Transport and Environment, 16, 260–264.

    Article  Google Scholar 

  • Cheong, C., & Tan, K. (2008). A multi-objective multi-colony ant algorithm for solving the berth allocation problem. In Y. Liu, A. Sun, H. T. Loh, W. F. Lu, & E.-P. Lim (Eds.), Advances of computational intelligence in industrial systems, volume 116 of studies in computational intelligence (Vol. 116, pp. 333–350). Berlin: Springer.

    Chapter  Google Scholar 

  • Cheong, C., Tan, K., Liu, D., & Lin, C. (2010). Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research, 180, 63–103.

    Article  Google Scholar 

  • Christiansen, M., Fagerholt, K., Nygreen, B., & Ronen, D. (2007). Maritime transportation. In C. Barnhart & G. Laporte (Eds.), Transportation volume 14 of handbooks in operations research and management science (pp. 189–284). Amsterdam: Elsevier.

    Google Scholar 

  • Cordeau, J. F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526–538.

    Article  Google Scholar 

  • Expósito-Izquierdo, C., Lalla-Ruiz, E., Melián Batista, B., & Moreno-Vega, J. M. (2013). Optimization of container terminal problems. Lecture Notes in Computer Science, 8111, 324–331.

    Article  Google Scholar 

  • Giallombardo, G., Moccia, L., Salani, M., & Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological, 44(2), 232–245.

    Article  Google Scholar 

  • Guldogan, E., Bulut, O., & Tasgetiren, M. F. (2012). A dynamic berth allocation problem with priority considerations under stochastic nature. Lecture Notes in Computer Science, 6839, 74–82.

    Article  Google Scholar 

  • Hoffarth, L., & Voß, S. (1994). Liegeplatzdisposition auf einem Container Terminal—Ansätze zur Entwicklung eines entscheidungsunterstützenden Systems. In H. Dyckhoff, U. Derigs, M. Salomon, & H. C. Tijms (Eds.), Operations research proceedings 1993 (pp. 89–95). Berlin: Springer.

    Chapter  Google Scholar 

  • Imai, A., Nishimura, E., & Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35(4), 401–417.

    Article  Google Scholar 

  • Imai, A., Yamakawa, Y., & Huang, K. (2014). The strategic berth template problem. Transportation Research Part E: Logistics and Transportation Review, 72, 77–100.

    Article  Google Scholar 

  • Karafa, J., Golias, M. M., Ivey, S., Saharidis, G. K. D., & Leonardos, N. (2013). The berth allocation problem with stochastic vessel handling times. The International Journal of Advanced Manufacturing Technology, 65(1–4), 473–484.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Lalla-Ruiz, E., & Voß, S. (2014a). Towards a matheuristic approach for the berth allocation problem. Lecture Notes in Computer Science, 8426, 218–222.

    Article  Google Scholar 

  • Lalla-Ruiz, E., & Voß, S. (2014b). POPMUSIC as a matheuristic for the berth allocation problem. Annals of Mathematics and Artificial Intelligence. doi:10.1007/s10472-014-9444-4.

  • Lee, D.-H., & Jin, J. G. (2013). Feeder vessel management at container transshipment terminals. Transportation Research Part E: Logistics and Transportation Review, 49(1), 201–216.

    Article  Google Scholar 

  • Maniezzo, V., Stützle, T., & Voß, S. (Eds.). (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming. Annals of Information Systems (Vol. 10). New York: Springer.

    Google Scholar 

  • Meyer, J., Stahlbock, R., & Voß, S. (2012). Slow steaming in container shipping. In R. H. Sprague (Ed.), Proceedings of the 45th annual Hawaii international conference on system sciences (HICSS 2012) (pp. 1306–1314). Piscataway: IEEE.

  • Nishimura, E., Imai, A., & Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131(2), 282–292.

    Article  Google Scholar 

  • Notteboom, T., & Rodrigue, J.-P. (2008). Containerisation, box logistics and global supply chains: The integration of ports and liner shipping networks. Maritime Economics and Logistics, 10(1), 152–174.

    Article  Google Scholar 

  • Ostertag, A., Doerner, K. F., Hartl, R. F., Taillard, E. D., & Waelti, P. (2009). POPMUSIC for a real-world large-scale vehicle routing problem with time windows. Journal of the Operational Research Society, 60, 934–943.

    Article  Google Scholar 

  • Psaraftis, H. N., & Kontovas, C. A. (2013). Speed models for energy-efficient maritime transportation: A taxonomy and survey. Transportation Research Part C: Emerging Technologies, 26, 331–351.

    Article  Google Scholar 

  • Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472.

    Article  Google Scholar 

  • Sniedovich, M., & Voß, S. (2006). The corridor method: A dynamic programming inspired metaheuristic. Control and Cybernetics, 35(3), 551–578.

    Google Scholar 

  • Steenken, D., Voß, S., & Stahlbock, R. (2004). Container terminal operation and operations research—A classification and literature review. OR Spectrum, 26, 3–49.

    Article  Google Scholar 

  • Taillard, É., & Voß, S. (2002). POPMUSIC—Partial optimization metaheuristic under special intensification conditions. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 613–629). Boston: Kluwer.

    Chapter  Google Scholar 

  • User’s manual for CPLEX. (2011). IBM Ilog CPLEX, 12.3.

  • Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review, 54, 14–31.

    Article  Google Scholar 

  • Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148–161.

    Article  Google Scholar 

  • Voß, S. (2015). Berth allocation: Do we have it all wrong? Technical report, University of Hamburg, Institute of Information Systems.

  • Wiegmans, B. W., Rietveld, P., & Nijkamp, P. (2001). Container terminal services and quality. Serie Research Memoranda 0040, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

  • Xu, D., Li, C. L., & Leung, J. Y. T. (2012). Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research, 216(1), 47–56.

    Article  Google Scholar 

Download references

Acknowledgments

Dedicated towards the memory of Arne Lokketangen. This work has been partially funded by the Spanish Ministry of Economy and Competitiveness (Project TIN2012-32608). Eduardo Lalla-Ruiz and Christopher Expósito-Izquierdo thank the Canary Islands Government for the financial support they receive through their doctoral grant.

Author information

Authors and Affiliations

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

    Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, Belén Melián-Batista & J. Marcos Moreno-Vega

  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, Valparaiso, 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

  3. Christopher Expósito-Izquierdo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Belén Melián-Batista
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. Marcos Moreno-Vega
    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., Expósito-Izquierdo, C. et al. A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations. Ann Oper Res 253, 871–897 (2017). https://doi.org/10.1007/s10479-015-2055-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-2055-6

Keywords

Search

Navigation