{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:15:12Z","timestamp":1742958912067,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031165788"},{"type":"electronic","value":"9783031165795"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16579-5_2","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:02:54Z","timestamp":1663110174000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Self-adaptive Hybrid Search Technique with\u00a0Its Application to\u00a0the\u00a0Quadratic Semi-assignment and\u00a0Berth Allocation Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8466-1380","authenticated-orcid":false,"given":"Mehrdad","family":"Amirghasemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8430-1932","authenticated-orcid":false,"given":"Marcella","family":"Bernardo Papini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Amirghasemi, M.: An effective parallel evolutionary metaheuristic with its application to three optimization problems. Appl. Intell. 1\u201323 (2022). https:\/\/doi.org\/10.1007\/s10489-022-03599-w","DOI":"10.1007\/s10489-022-03599-w"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-030-00898-7_30","volume-title":"Computational Logistics","author":"M Amirghasemi","year":"2018","unstructured":"Amirghasemi, M., Zamani, R.: An effective structural iterative refinement technique for solving the quadratic assignment problem. In: Cerulli, R., Raiconi, A., Vo\u00df, S. (eds.) ICCL 2018. LNCS, vol. 11184, pp. 446\u2013460. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00898-7_30"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-030-31140-7_19","volume-title":"Computational Logistics","author":"M Amirghasemi","year":"2019","unstructured":"Amirghasemi, M., Zamani, R.: Developing an effective decomposition-based procedure for solving the quadratic assignment problem. In: Paternina-Arboleda, C., Vo\u00df, S. (eds.) ICCL 2019. LNCS, vol. 11756, pp. 297\u2013316. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31140-7_19"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Arango, C., Cort\u00e9s, P., Escudero, A., Onieva, L.: Genetic algorithm for the dynamic berth allocation problem in real time. In: Yang, X.S., Cui, Z., Xiao, R., Gandomi, A.H., Karamanoglu, M. (eds.) Swarm Intelligence and Bio-Inspired Computation, pp. 367\u2013383. Elsevier, Oxford (2013). https:\/\/doi.org\/10.1016\/B978-0-12-405163-8.00017-X","DOI":"10.1016\/B978-0-12-405163-8.00017-X"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114198","volume":"167","author":"ET Bacalhau","year":"2021","unstructured":"Bacalhau, E.T., Casacio, L., de Azevedo, A.T.: New hybrid genetic algorithms to solve dynamic berth allocation problem. Expert Syst. Appl. 167, 114198 (2021). https:\/\/doi.org\/10.1016\/j.eswa.2020.114198","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C Bierwirth","year":"2010","unstructured":"Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615\u2013627 (2010). https:\/\/doi.org\/10.1016\/j.ejor.2009.05.031","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K Buhrkal","year":"2011","unstructured":"Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R.: Models for the discrete berth allocation problem: a computational comparison. Transp. Res. Part E: Logist. Transp. Rev. 47(4), 461\u2013473 (2011). https:\/\/doi.org\/10.1016\/j.tre.2010.11.016","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0055882","volume-title":"Practice and Theory of Automated Timetabling II","author":"B Bullnheimer","year":"1998","unstructured":"Bullnheimer, B.: An examination scheduling model to maximize students\u2019 study time. In: Burke, E., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 78\u201391. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055882"},{"key":"2_CR9","unstructured":"Christensen, C., Holst, C.: Berth allocation in container terminals. Master\u2019s thesis, Department of Informatics and Mathematical Modelling, Technical University of Denmark (2008)"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J.F., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 39(4), 526\u2013538 (2005). https:\/\/doi.org\/10.1287\/trsc.1050.0120","journal-title":"Transp. Sci."},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01721163","volume":"11","author":"W Domschke","year":"1989","unstructured":"Domschke, W.: Schedule synchronization for public transit networks. Oper. Res. Spektr. 11(1), 17\u201324 (1989)","journal-title":"Oper. Res. Spektr."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-77537-6_23","volume-title":"New Directions for Operations Research in Manufacturing","author":"W Domschke","year":"1992","unstructured":"Domschke, W., Forst, P., Vo\u00df, S.: Tabu search techniques for the quadratic semi-assignment problem. In: Fandel, G., Gulledge, T., Jones, A. (eds.) New Directions for Operations Research in Manufacturing, pp. 389\u2013405. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/978-3-642-77537-6_23"},{"key":"2_CR13","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-78910-6_28","volume-title":"Operations Research Proceedings 1993","author":"L Hoffarth","year":"1994","unstructured":"Hoffarth, L., Vo\u00df, S.: Liegeplatzdisposition auf einem container terminal\u2014Ans\u00e4tze zur Entwicklung eines entscheidungsunterst\u00fctzenden systems. In: Operations Research Proceedings 1993. ORP, vol. 1993, pp. 89\u201395. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-642-78910-6_28"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.cie.2015.04.035","volume":"89","author":"ZH Hu","year":"2015","unstructured":"Hu, Z.H.: Multi-objective genetic algorithm for berth allocation problem considering daytime preference. Comput. Industr. Eng. 89, 2\u201314 (2015). https:\/\/doi.org\/10.1016\/j.cie.2015.04.035","journal-title":"Comput. Industr. Eng."},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"35","author":"A Imai","year":"2001","unstructured":"Imai, A., Nishimura, E., Papadimitriou, S.: The dynamic berth allocation problem for a container port. Transp. Res. Part B: Methodol. 35(4), 401\u2013417 (2001). https:\/\/doi.org\/10.1016\/S0191-2615(99)00057-0","journal-title":"Transp. Res. Part B: Methodol."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tre.2017.06.013","volume":"105","author":"C Iris","year":"2017","unstructured":"Iris, C., 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). https:\/\/doi.org\/10.1016\/j.tre.2017.06.013","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"2_CR17","unstructured":"Jotshi, A., Batta, R.: Finding robust paths for routing ambulances in a dynamic disaster environment. In: Proceedings of the IIE Annual Conference, pp. 1\u20136 (2004)"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.ejor.2019.03.036","volume":"278","author":"A Kramer","year":"2019","unstructured":"Kramer, A., Lalla-Ruiz, E., Iori, M., Vo\u00df, S.: Novel formulations and modeling enhancements for the dynamic berth allocation problem. Eur. J. Oper. Res. 278(1), 170\u2013185 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.03.036","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11518-016-5301-9","volume":"25","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: Improving solver performance through redundancy. J. Syst. Sci. Syst. Eng. 25(3), 303\u2013325 (2016). https:\/\/doi.org\/10.1007\/s11518-016-5301-9","journal-title":"J. Syst. Sci. Syst. Eng."},{"issue":"6","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1016\/j.engappai.2012.06.001","volume":"25","author":"E Lalla-Ruiz","year":"2012","unstructured":"Lalla-Ruiz, E., Melian-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\u20131141 (2012). https:\/\/doi.org\/10.1016\/j.engappai.2012.06.001","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E Nishimura","year":"2001","unstructured":"Nishimura, E., Imai, A., Papadimitriou, S.: Berth allocation planning in the public berth system by genetic algorithms. Eur. J. Oper. Res. 131(2), 282\u2013292 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00128-4","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1134\/S0005117916070079","volume":"77","author":"AV Panyukov","year":"2016","unstructured":"Panyukov, A.V., Shangin, R.E.: Algorithm for the discrete Weber\u2019s problem with an accuracy estimate. Autom. Remote. Control. 77(7), 1208\u20131215 (2016). https:\/\/doi.org\/10.1134\/S0005117916070079","journal-title":"Autom. Remote. Control."},{"key":"2_CR23","unstructured":"Schr\u00f6der, M., Solchenbach, I.: Optimization of transfer quality in regional public transit. Technical report 84, Fraunhofer (ITWM) (2006)"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Theofanis, S., Boile, M., Golias, M.: An optimization based genetic algorithm heuristic for the berth allocation problem. In: 2007 IEEE Congress on Evolutionary Computation, pp. 4439\u20134445 (2007). https:\/\/doi.org\/10.1109\/CEC.2007.4425052","DOI":"10.1109\/CEC.2007.4425052"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Vitaladevuni, S.N., Basri, R.: Co-clustering of image segments using convex optimization applied to EM neuronal reconstruction. In: 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 2203\u20132210 (2010). https:\/\/doi.org\/10.1109\/CVPR.2010.5539901","DOI":"10.1109\/CVPR.2010.5539901"},{"key":"2_CR26","series-title":"Springer Tracts in Nature-Inspired Computing","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-981-15-2133-1_6","volume-title":"Frontier Applications of Nature Inspired Computation","author":"R Zamani","year":"2020","unstructured":"Zamani, R., Amirghasemi, M.: A self-adaptive nature-inspired procedure for solving the quadratic assignment problem. In: Khosravy, M., Gupta, N., Patel, N., Senjyu, T. (eds.) Frontier Applications of Nature Inspired Computation. STNC, pp. 119\u2013147. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-2133-1_6"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16579-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:07:24Z","timestamp":1663110444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16579-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031165788","9783031165795"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16579-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eventum.upf.edu\/78123\/detail\/international-conference-on-computational-logistics-iccl-2022.html","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - 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 (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}