{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T09:06:55Z","timestamp":1777626415664,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we propose an adaptive large neighborhood search-based matheuristic algorithm to solve a multi-product many-to-many maritime inventory routing problem. The problem addresses a short sea inventory routing problem that aims to find the best route and distribution plan for multiple products with a heterogeneous fleet of vessels through a network including several producers and customers. Each port can be visited a given number of times during the planning horizon, and the stock level for each product should lie within the predefined bound limits. The problem was introduced by Hemmati et al. (Eur J Oper Res 252:775\u2013788, 2016). They developed a mixed integer programming formulation and proposed a matheuristic algorithm to solve the problem. Although their proposed algorithm worked well in terms of running time, it suffers from disregarding a part of the solution space. In this study, we propose a new matheuristic algorithm to find better solutions by exploring the entire solution space for the same problem. In our solution methodology, we split the variables into routing and non-routing variables. Then in an iterative process, we determine the values of the routing variables with an adaptive large neighborhood search algorithm, and we pass them as input to a penalized model which is a relaxed and modified version of the mathematical model introduced in Hemmati et al. (2016). The information from solving the penalized model, including the values of the non-routing variables, is then passed to the adaptive large neighborhood search algorithm for the next iteration. Several problem-dependent operators are defined. The operators use the information they get from the penalized model and focus on decreasing the penalty values. Computational results show up to 26% improvement in the quality of the solutions for the group of instances with a large feasible solution space. We get the optimal value for the remaining instances matched with the reported results.<\/jats:p>","DOI":"10.1007\/s10287-023-00478-8","type":"journal-article","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T18:02:17Z","timestamp":1696096937000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0464-4551","authenticated-orcid":false,"given":"Nooshin","family":"Heidari","sequence":"first","affiliation":[]},{"given":"Ahmad","family":"Hemmati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"issue":"4","key":"478_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/net.21518","volume":"62","author":"A Agra","year":"2013","unstructured":"Agra A, Andersson H, Christiansen M, Wolsey L (2013) A maritime inventory routing problem: discrete time formulations and valid inequalities. Networks 62(4):297\u2013314","journal-title":"Networks"},{"issue":"3","key":"478_CR2","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1016\/j.ejor.2013.06.042","volume":"236","author":"A Agra","year":"2014","unstructured":"Agra A, Christiansen M, Delgado A, Simonetti L (2014) Hybrid heuristics for a short sea inventory routing problem. Eur J Oper Res 236(3):924\u2013935","journal-title":"Eur J Oper Res"},{"key":"478_CR3","doi-asserted-by":"crossref","unstructured":"Agra A, Christiansen M, Hvattum LM, Rodrigues F (2016) A MIP based local search heuristic for a stochastic maritime inventory routing problem. In International conference on computational logistics, pp 18\u201334. Springer","DOI":"10.1007\/978-3-319-44896-1_2"},{"issue":"1","key":"478_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11081-016-9319-0","volume":"18","author":"A Agra","year":"2017","unstructured":"Agra A, Christiansen M, Delgado A (2017) Discrete time and continuous time formulations for a short sea inventory routing problem. Optim Eng 18(1):269\u2013297","journal-title":"Optim Eng"},{"issue":"1","key":"478_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2005.06.047","volume":"176","author":"F Al-Khayyal","year":"2007","unstructured":"Al-Khayyal F, Hwang S-J (2007) Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: applications and model. Eur J Oper Res 176(1):106\u2013130","journal-title":"Eur J Oper Res"},{"issue":"9","key":"478_CR6","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","volume":"37","author":"H Andersson","year":"2010","unstructured":"Andersson H, Hoff A, Christiansen M, Hasle G, L\u00f8kketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37(9):1515\u20131536","journal-title":"Comput Oper Res"},{"key":"478_CR7","doi-asserted-by":"publisher","first-page":"105806","DOI":"10.1016\/j.cor.2022.105806","volume":"144","author":"I Brekk\u00e5","year":"2022","unstructured":"Brekk\u00e5 I, Rand\u00f8y S, Fagerholt K, Thun K, Vadseth ST (2022) The fish feed production routing problem. Comput Oper Res 144:105806","journal-title":"Comput Oper Res"},{"issue":"3","key":"478_CR8","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1016\/j.ejor.2021.02.027","volume":"294","author":"C Chen","year":"2021","unstructured":"Chen C, Demir E, Huang Y (2021) An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots. Eur J Oper Res 294(3):1164\u20131180","journal-title":"Eur J Oper Res"},{"issue":"1","key":"478_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.33.1.3","volume":"33","author":"M Christiansen","year":"1999","unstructured":"Christiansen M (1999) Decomposition of a combined inventory and time constrained ship routing problem. Transp Sci 33(1):3\u201316","journal-title":"Transp Sci"},{"issue":"1","key":"478_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2010.08.023","volume":"208","author":"M Christiansen","year":"2011","unstructured":"Christiansen M, Fagerholt K, Flatberg T, Haugen \u00d8, Kloster O, Lund EH (2011) Maritime inventory routing with multiple products: a case study from the cement industry. Eur J Oper Res 208(1):86\u201394","journal-title":"Eur J Oper Res"},{"issue":"1","key":"478_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Cordeau J-F, Laporte G (2013) Thirty years of inventory routing. Transp Sci 48(1):1\u201319","journal-title":"Transp Sci"},{"issue":"1","key":"478_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/03088839.2016.1216622","volume":"44","author":"GSdS Diz","year":"2017","unstructured":"Diz GSdS, Oliveira F, Hamacher S (2017) Improving maritime inventory routing: application to a Brazilian petroleum case. Marit Policy Manag 44(1):42\u201361","journal-title":"Marit Policy Manag"},{"issue":"1","key":"478_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1287\/opre.1110.0997","volume":"60","author":"FG Engineer","year":"2012","unstructured":"Engineer FG, Furman KC, Nemhauser GL, Savelsbergh MW, Song J-H (2012) A branch-price-and-cut algorithm for single-product maritime inventory routing. Oper Res 60(1):106\u2013122","journal-title":"Oper Res"},{"issue":"6","key":"478_CR14","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1287\/trsc.2019.0909","volume":"53","author":"V Fran\u00e7ois","year":"2019","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y (2019) Adaptive large neighborhood search for multitrip vehicle routing with time windows. Transp Sci 53(6):1706\u20131730","journal-title":"Transp Sci"},{"key":"#cr-split#-478_CR15.1","doi-asserted-by":"crossref","unstructured":"Friske MW, Buriol LS (2020) A multi-start algorithm and a large neighborhood search for a maritime","DOI":"10.1109\/CEC48606.2020.9185499"},{"key":"#cr-split#-478_CR15.2","unstructured":"inventory routing problem. In: 2020 IEEE congress on evolutionary computation (CEC), pp 1-8. IEEE"},{"key":"478_CR16","doi-asserted-by":"publisher","first-page":"105520","DOI":"10.1016\/j.cor.2021.105520","volume":"137","author":"MW Friske","year":"2022","unstructured":"Friske MW, Buriol LS, Camponogara E (2022) A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem. Comput Oper Res 137:105520","journal-title":"Comput Oper Res"},{"issue":"3","key":"478_CR17","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2016.01.060","volume":"252","author":"A Hemmati","year":"2016","unstructured":"Hemmati A, Hvattum LM, Christiansen M, Laporte G (2016) An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem. Eur J Oper Res 252(3):775\u2013788","journal-title":"Eur J Oper Res"},{"issue":"5","key":"478_CR18","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1016\/j.cor.2012.09.010","volume":"40","author":"M Hewitt","year":"2013","unstructured":"Hewitt M, Nemhauser G, Savelsbergh M, Song J-H (2013) A branch-and-price guided search approach to maritime inventory routing. Comput Oper Res 40(5):1410\u20131419","journal-title":"Comput Oper Res"},{"issue":"4598","key":"478_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"478_CR20","doi-asserted-by":"publisher","first-page":"105316","DOI":"10.1016\/j.cor.2021.105316","volume":"134","author":"IM Lianes","year":"2021","unstructured":"Lianes IM, Noreng MT, Fagerholt K, Slette HT, Meisel F (2021) The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints. Comput Oper Res 134:105316","journal-title":"Comput Oper Res"},{"issue":"46","key":"478_CR21","doi-asserted-by":"publisher","first-page":"20394","DOI":"10.1021\/acs.iecr.0c03186","volume":"59","author":"S Misra","year":"2020","unstructured":"Misra S, Kapadi M, Gudi RD (2020) Hybrid time-based framework for maritime inventory routing problem. Ind Eng Chem Res 59(46):20394\u201320409","journal-title":"Ind Eng Chem Res"},{"issue":"8","key":"478_CR22","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435","journal-title":"Comput Oper Res"},{"issue":"3","key":"478_CR23","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro GM, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728\u2013735","journal-title":"Comput Oper Res"},{"issue":"4","key":"478_CR24","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"issue":"2","key":"478_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.cie.2010.06.011","volume":"61","author":"N Siswanto","year":"2011","unstructured":"Siswanto N, Essam D, Sarker R (2011) Solving the ship inventory routing and scheduling problem with undedicated compartments. Comput Ind Eng 61(2):289\u2013299","journal-title":"Comput Ind Eng"},{"issue":"3","key":"478_CR26","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.cor.2010.10.031","volume":"40","author":"J-H Song","year":"2013","unstructured":"Song J-H, Furman KC (2013) A maritime inventory routing problem: practical approach. Comput Oper Res 40(3):657\u2013665","journal-title":"Comput Oper Res"},{"key":"478_CR27","first-page":"2020","volume":"1\u201314","author":"Z Yu","year":"2020","unstructured":"Yu Z, Zhang P, Yu Y, Sun W, Huang M (2020) An adaptive large neighborhood search for the larger-scale instances of green vehicle routing problem with time windows. Complexity 1\u201314:2020","journal-title":"Complexity"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00478-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00478-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00478-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T16:14:06Z","timestamp":1699632846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00478-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,30]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["478"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00478-8","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,30]]},"assertion":[{"value":"30 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None of the authors have any financial or non-financial interests that are directly or indirectly related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"44"}}