Top

Published in:

2019 | OriginalPaper | Chapter

A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints

Authors : Issam Krimi, Afaf Aloullal, Rachid Benmansour, Abdessamad Ait El Cadi, Laurent Deshayes, David Duvivier

Published in: Variable Neighborhood Search

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

In this paper, we consider the integrated Berth Allocation and Crane Assignment problem, with availability constraints and high tides restrictions, in bulk port context. We were inspired by a real case study of a port owned by our industrial partner. The objective is to minimize the total penalty of tardiness. First, we implemented a greedy heuristic to compute an initial solution. Then, we proposed a sequential Variable Neighborhood Descent (seq-VND) for the problem. In addition, we compared the efficiency of different scenarios for the seq-VND against results given by a mathematical model for the problem.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter An Evolutionary Variable Neighborhood Descent for Addressing an Electric VRP Variant

next chapter A Variable Neighborhood Search Approach for Solving the Multidimensional Multi-Way Number Partitioning Problem

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

Barros, V.H., Costa, T.S., Oliveira, A.C., Lorena, L.A.: Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Comput. Ind. Eng. 60(4), 606–613 (2011)CrossRef

Becker, C., Scholl, A.: A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3), 694–715 (2006)MathSciNetCrossRef

Blazewicz, J., Cheng, T.E., Machowiak, M., Oguz, C.: Berth and quay crane allocation: a moldable task scheduling model. J. Oper. Res. Soc. 62(7), 1189–1197 (2011)CrossRef

Chang, D., Jiang, Z., Yan, W., He, J.: Integrating berth allocation and quay crane assignments. Transp. Res. Part E: Logist. Transp. Rev. 46(6), 975–990 (2010)CrossRef

Cheng, J.K., Tahar, R.M., Ang, C.L.: A system dynamics approach to operational and strategic planning of a container terminal. Int. J. Logist. Syst. Manag. 10(4), 420–436 (2011)CrossRef

Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115–123 (2014)CrossRef

Duarte, A., Mladenović, N., Sánchez-Oro, J., Todosijević, R.: Variable neighborhood descent. In: Handbook of Heuristics, pp. 1–27 (2016)

Ernst, A.T., Oğuz, C., Singh, G., Taherkhani, G.: Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 20(5), 459–473 (2017)MathSciNetCrossRef

10.

Fu, Y.M., Diabat, A.: A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. 39(3–4), 1194–1201 (2015)MathSciNetCrossRef

11.

Giallombardo, G., Moccia, L., Salani, M., Vacca, I.: Modeling and solving the tactical berth allocation problem. Transp. Res. Part B: Methodol. 44(2), 232–245 (2010)CrossRef

12.

Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)MathSciNetCrossRef

13.

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)CrossRef

14.

Iris, Ç., Pacino, D., Ropke, S.: Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem. Transp. Res. Part E: Logist. Transp. Rev. 105, 123–147 (2017)CrossRef

15.

Iris, Ç., Pacino, D., Ropke, S., Larsen, A.: Integrated berth allocation and quay crane assignment problem: set partitioning models and computational results. Transp. Res. Part E: Logist. Transp. Rev. 81, 75–97 (2015)CrossRef

16.

Krimi, I., Benmansour, R., Ait El Cadi, A., Deshayes, L., Duvivier, D., Elhachemi, N.: A rolling horizon approach for the multi-quay berth allocation and crane assignment problem in bulk ports. Computer and Industrial Engineering, under review

17.

Liang, C., Huang, Y., Yang, Y.: A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput. Ind. Eng. 56(3), 1021–1028 (2009)CrossRef

18.

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

19.

Park, Y.-M., Kim, K.H.: A scheduling method for berth and quay cranes. In: Günther, H.-O., Kim, K.H. (eds.) Container Terminals and Automated Transport Systems, pp. 159–181. Springer, Heidelberg (2005). https://doi.org/10.1007/3-540-26686-0_7CrossRef

20.

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

21.

Rodriguez-Molins, M., Salido, M.A., Barber, F.: A grasp-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds. Appl. Intell. 40(2), 273–290 (2014)CrossRef

22.

Stopford, M.: Maritime Economics. Routledge, Abingdon (2013)

23.

Umang, N., Bierlaire, M., Vacca, I.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. Part E: Logist. Transp. Rev. 54, 14–31 (2013)CrossRef

24.

Vacca, I., Salani, M., Bierlaire, M.: An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transp. Sci. 47(2), 148–161 (2013)CrossRef

25.

Yang, C., Wang, X., Li, Z.: An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Comput. Ind. Eng. 63(1), 243–253 (2012)CrossRef

Title: A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints
Authors: Issam Krimi
Afaf Aloullal
Rachid Benmansour
Abdessamad Ait El Cadi
Laurent Deshayes
David Duvivier
Publisher: Springer International Publishing
Book: Variable Neighborhood Search
Print ISBN: 978-3-030-15842-2

Electronic ISBN: 978-3-030-15843-9

Copyright Year: 2019
DOI: https://doi.org/10.1007/978-3-030-15843-9_18

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner