{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:10:34Z","timestamp":1743009034769,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812408"},{"type":"electronic","value":"9783031812415"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_28","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:34Z","timestamp":1735652734000},"page":"343-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Heuristic Solution Approach for\u00a0Bulk Port Routing Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8664-5955","authenticated-orcid":false,"given":"Sara","family":"Mallah","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0642-0041","authenticated-orcid":false,"given":"Oulaid","family":"Kamach","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4040-3608","authenticated-orcid":false,"given":"Malek","family":"Masmoudi","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Chebak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/J.CJA.2017.05.012","volume":"30","author":"W Dai","year":"2017","unstructured":"Dai, W., Zhang, J., Sun, X.: On solving multi-commodity flow problems: an experimental evaluation. Chin. J. Aeronaut. 30(4), 1481\u20131492 (2017). https:\/\/doi.org\/10.1016\/J.CJA.2017.05.012","journal-title":"Chin. J. Aeronaut."},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Dai, W., Sun, X., Wandelt, S.: Finding feasible solutions for multi-commodity flow problems. In: 35th Chinese Control Conference (CCC) (2016). https:\/\/doi.org\/10.1109\/ChiCC.2016.7553801","DOI":"10.1109\/ChiCC.2016.7553801"},{"key":"28_CR3","doi-asserted-by":"publisher","unstructured":"Trivella, A., Corman, F., Koza, D. F., Pisinger, D.: The multi-commodity network flow problem with soft transit time constraints: application to liner shipping. Transp. Res. Part E Logistics Transport. Rev. 150, 1366\u20135545 (2021). https:\/\/doi.org\/10.1016\/j.tre.2021.102342","DOI":"10.1016\/j.tre.2021.102342"},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Ago, M., Nishi, T., Konishi, M.. Simultaneous optimization of storage allocation and routing problems for belt-conveyor transportation. J. Adv. Mech. Des. Syst. Manuf. 1(2), 250\u2013261 (2007). https:\/\/doi.org\/10.1299\/jamdsm.1.250","DOI":"10.1299\/jamdsm.1.250"},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Menezes, G. C., Mateus, G. R., Ravetti, M. G.: A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports. Eur. J. Oper. Res. 258(3), 926\u2013937 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.08.073","DOI":"10.1016\/j.ejor.2016.08.073"},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Lim, A.: The berth planning problem. Oper. Res. Lett. 22(2-3), 105\u2013110 (1998). https:\/\/doi.org\/10.1016\/S0167-6377(98)00010-8","DOI":"10.1016\/S0167-6377(98)00010-8"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Chen, P., Fu, Z., Lim, A., Rodrigues, B.: Port yard storage optimization. IEEE Trans. Autom. Sci. Eng. 1(1), 26\u201337 (2004)","DOI":"10.1109\/TASE.2004.829412"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Mallah, S., Aloullal, A., Kamach, O., Kouiss, K., Najid, N., Deshayes, L.: A novel integration approach for a complex supply chain optimization problem in an export bulk port. (2020). In Proceedings of the 7th Int. Conf. Control, Decis. Inf. Technol. \u201cCoDIT\u201d (ed. by IEEE), pp. 751\u2013756 (2020). https:\/\/doi.org\/10.1109\/CoDIT49905.2020.9263911","DOI":"10.1109\/CoDIT49905.2020.9263911"},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Mallah, S., Aloullal, A., Kamach, O., Masmoudi, M., Kouiss, K., Chebak, A.: Modeling the bulk port belt-conveyor routing problem considering interactions with storage spaces and loading operations. IEEE Access 11 , 87709\u201387731 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3305572","DOI":"10.1109\/ACCESS.2023.3305572"},{"key":"28_CR10","doi-asserted-by":"publisher","unstructured":"Krimi, I., Todosijevi\u0107, R., Benmansour, R., Ratli, M., Cadi, A. A. E., Aloullal, A.: Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. J. Global Optim. 78(2), 349\u2013373 (2020). https:\/\/doi.org\/10.1007\/S10898-020-00884-1\/TABLES\/10","DOI":"10.1007\/S10898-020-00884-1\/TABLES\/10"},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Setak, M., Feizizadeh, F., Tikani, H., Ardakani, E. S.: A bi-level stochastic optimization model for reliable supply chain in competitive environments: Hybridizing exact method and genetic algorithm. Appl. Math. Model. 75, 310\u2013332 (2019). https:\/\/doi.org\/10.1016\/j.apm.2019.05.037","DOI":"10.1016\/j.apm.2019.05.037"}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:04:43Z","timestamp":1735653883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}