{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:28:39Z","timestamp":1742938119543,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031629211"},{"type":"electronic","value":"9783031629228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62922-8_14","type":"book-chapter","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T13:02:58Z","timestamp":1718629378000},"page":"204-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Disjunctive Graph Solution Representation for the Continuous and Dynamic Berth Allocation Problem"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Cheimanoff","sequence":"first","affiliation":[]},{"given":"Pierre","family":"F\u00e9ni\u00e8s","sequence":"additional","affiliation":[]},{"given":"Mohamed Nour","family":"Kitri","sequence":"additional","affiliation":[]},{"given":"Nikolay","family":"Tchernev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"issue":"3","key":"14_CR1","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"C Bierwirth","year":"2015","unstructured":"Bierwirth, C., Meisel, F.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244(3), 675\u2013689 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR3","unstructured":"Carlo, H. J., Vis, I. F. A., Roodbergen, K. J.: Seaside operations in container terminals: Literature overview, trends, and research directions. Flexible Services and Manufacturing Journal, 1\u201339 (2013)"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan, Y., Cheung, R.K.: The berth allocation problem: models and solution methods. OR Spectr. 26(1), 75\u201392 (2004). https:\/\/doi.org\/10.1007\/s00291-003-0140-8","journal-title":"OR Spectr."},{"key":"14_CR5","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2019","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 57\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3"},{"issue":"4","key":"14_CR6","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)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"14_CR7","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."},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"D-H Lee","year":"2010","unstructured":"Lee, D.-H., Chen, J.H., Cao, J.X.: The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp. Res. Part E: Logist. Transp. Rev. 46(6), 1017\u20131029 (2010)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"14_CR9","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-91086-4_5","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2019","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 129\u2013168. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_5"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Meisel, F., Bierwirth, C.: Heuristics for the integration of crane productivity in the berth allocation problem. Trans. Res. Part E: Log. and Trans. Rev. 45(1), 196\u2013209 (2009)","DOI":"10.1016\/j.tre.2008.03.001"},{"issue":"6","key":"14_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manage. Sci. 42(6), 797\u2013813 (1996)","journal-title":"Manage. Sci."},{"key":"14_CR12","unstructured":"Roy, B., Sussmann, B.: Les probl\u00e8mes d'ordonnancement avec constraintes disjonctives, SEMA, Note D.S., No. 9 (1964)"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","volume":"42","author":"F Wang","year":"2007","unstructured":"Wang, F., Lim, A.: A stochastic beam search for the berth allocation problem. Decis. Support. Syst. 42(4), 2186\u20132196 (2007)","journal-title":"Decis. Support. Syst."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62922-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T13:05:10Z","timestamp":1718629510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62922-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629211","9783031629228"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62922-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}