{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:59:26Z","timestamp":1742961566875,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030158422"},{"type":"electronic","value":"9783030158439"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15843-9_18","type":"book-chapter","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T08:02:38Z","timestamp":1552464158000},"page":"232-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints"],"prefix":"10.1007","author":[{"given":"Issam","family":"Krimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afaf","family":"Aloullal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdessamad","family":"Ait\u00a0El\u00a0Cadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Deshayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Duvivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","volume":"264","author":"A Agra","year":"2018","unstructured":"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\u2013148 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cie.2010.12.018","volume":"60","author":"VH Barros","year":"2011","unstructured":"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\u2013613 (2011)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker, C., Scholl, A.: A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3), 694\u2013715 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1057\/jors.2010.54","volume":"62","author":"J Blazewicz","year":"2011","unstructured":"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\u20131197 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"18_CR5","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.tre.2010.05.008","volume":"46","author":"D Chang","year":"2010","unstructured":"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\u2013990 (2010)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1504\/IJLSM.2011.043103","volume":"10","author":"JK Cheng","year":"2011","unstructured":"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\u2013436 (2011)","journal-title":"Int. J. Logist. Syst. Manag."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2013.12.012","volume":"73","author":"A Diabat","year":"2014","unstructured":"Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115\u2013123 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Duarte, A., Mladenovi\u0107, N., S\u00e1nchez-Oro, J., Todosijevi\u0107, R.: Variable neighborhood descent. In: Handbook of Heuristics, pp. 1\u201327 (2016)","DOI":"10.1007\/978-3-319-07153-4_9-1"},{"issue":"5","key":"18_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10951-017-0510-8","volume":"20","author":"AT Ernst","year":"2017","unstructured":"Ernst, A.T., O\u011fuz, C., Singh, G., Taherkhani, G.: Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 20(5), 459\u2013473 (2017)","journal-title":"J. Sched."},{"issue":"3\u20134","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.apm.2014.07.006","volume":"39","author":"YM Fu","year":"2015","unstructured":"Fu, Y.M., Diabat, A.: A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. 39(3\u20134), 1194\u20131201 (2015)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.trb.2009.07.003","volume":"44","author":"G Giallombardo","year":"2010","unstructured":"Giallombardo, G., Moccia, L., Salani, M., Vacca, I.: Modeling and solving the tactical berth allocation problem. Transp. Res. Part B: Methodol. 44(2), 232\u2013245 (2010)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.trb.2004.04.004","volume":"39","author":"A Imai","year":"2005","unstructured":"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\u2013221 (2005)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tre.2017.06.013","volume":"105","author":"\u00c7 Iris","year":"2017","unstructured":"Iris, \u00c7., 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\u2013147 (2017)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tre.2015.06.008","volume":"81","author":"\u00c7 Iris","year":"2015","unstructured":"Iris, \u00c7., 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\u201397 (2015)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"18_CR16","unstructured":"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"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"C Liang","year":"2009","unstructured":"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\u20131028 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","volume":"45","author":"F Meisel","year":"2009","unstructured":"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\u2013209 (2009)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-26686-0_7","volume-title":"Container Terminals and Automated Transport Systems","author":"Y-M Park","year":"2005","unstructured":"Park, Y.-M., Kim, K.H.: A scheduling method for berth and quay cranes. In: G\u00fcnther, H.-O., Kim, K.H. (eds.) Container Terminals and Automated Transport Systems, pp. 159\u2013181. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/3-540-26686-0_7"},{"issue":"11","key":"18_CR20","first-page":"14136","volume":"38","author":"B Raa","year":"2011","unstructured":"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\u201314147 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"18_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10489-013-0462-4","volume":"40","author":"M Rodriguez-Molins","year":"2014","unstructured":"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\u2013290 (2014)","journal-title":"Appl. Intell."},{"key":"18_CR22","doi-asserted-by":"crossref","DOI":"10.4324\/9780203442661","volume-title":"Maritime Economics","author":"M Stopford","year":"2013","unstructured":"Stopford, M.: Maritime Economics. Routledge, Abingdon (2013)"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tre.2013.03.003","volume":"54","author":"N Umang","year":"2013","unstructured":"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\u201331 (2013)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/trsc.1120.0428","volume":"47","author":"I Vacca","year":"2013","unstructured":"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\u2013161 (2013)","journal-title":"Transp. Sci."},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.cie.2012.03.004","volume":"63","author":"C Yang","year":"2012","unstructured":"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\u2013253 (2012)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15843-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:05:00Z","timestamp":1558343100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15843-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030158422","9783030158439"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15843-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sithonia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vns2018.uom.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14 submissions were accepted for oral presentation only.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}