Maritime inventory routing with an application to fish feed distribution

IF 3.9 Q2 TRANSPORTATION
Anders Bjelland , Aksel Borgen , Sjur Wold , Kjetil Fagerholt , Dimitri J. Papageorgiou , Kristian Thun , Simen Tung Vadseth
{"title":"Maritime inventory routing with an application to fish feed distribution","authors":"Anders Bjelland ,&nbsp;Aksel Borgen ,&nbsp;Sjur Wold ,&nbsp;Kjetil Fagerholt ,&nbsp;Dimitri J. Papageorgiou ,&nbsp;Kristian Thun ,&nbsp;Simen Tung Vadseth","doi":"10.1016/j.martra.2025.100139","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies a maritime inventory routing problem (MIRP) faced by fish feed suppliers responsible for distributing different types of fish feed from one or several production facilities to a number of fish farms located at sea with a given heterogeneous fleet of specialized vessels. The feed supplier needs to maintain sufficient inventory levels at the farms at all times while minimizing the distribution costs. We propose a discrete-time mixed-integer programming (MIP) model for the fish feed MIRP. Since a commercial MIP-solver can only solve small problem instances, we also propose a matheuristic for solving real-life instances. The matheuristic employs a memetic algorithm, a metaheuristic combining a genetic algorithm with local search to decide how to route the vessels, coupled with a linear program for assigning quantities along the vessel routes. We perform a computational study on a number of realistic test instances generated using data from one of Norway’s largest fish feed suppliers. We show that the matheuristic produces reasonable solutions where the commercial MIP-solver fails, and as such can provide valuable decision support.</div></div>","PeriodicalId":100885,"journal":{"name":"Maritime Transport Research","volume":"9 ","pages":"Article 100139"},"PeriodicalIF":3.9000,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Maritime Transport Research","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2666822X25000115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

This paper studies a maritime inventory routing problem (MIRP) faced by fish feed suppliers responsible for distributing different types of fish feed from one or several production facilities to a number of fish farms located at sea with a given heterogeneous fleet of specialized vessels. The feed supplier needs to maintain sufficient inventory levels at the farms at all times while minimizing the distribution costs. We propose a discrete-time mixed-integer programming (MIP) model for the fish feed MIRP. Since a commercial MIP-solver can only solve small problem instances, we also propose a matheuristic for solving real-life instances. The matheuristic employs a memetic algorithm, a metaheuristic combining a genetic algorithm with local search to decide how to route the vessels, coupled with a linear program for assigning quantities along the vessel routes. We perform a computational study on a number of realistic test instances generated using data from one of Norway’s largest fish feed suppliers. We show that the matheuristic produces reasonable solutions where the commercial MIP-solver fails, and as such can provide valuable decision support.
海上库存路由与应用的鱼饲料分配
本文研究了鱼饲料供应商面临的海上库存路线问题(MIRP),这些供应商负责将不同类型的鱼饲料从一个或几个生产设施分发到位于海上的多个具有给定异构专用船队的养鱼场。饲料供应商需要在农场保持足够的库存水平,同时尽量减少配送成本。提出了一种鱼饲料MIRP的离散时间混合整数规划模型。由于商业mip求解器只能解决小问题实例,我们还提出了一个数学方法来解决现实生活中的实例。数学算法采用模因算法,一种结合遗传算法和局部搜索的元启发式算法来决定船只的路线,再加上沿船只路线分配数量的线性程序。我们对使用挪威最大的鱼饲料供应商之一的数据生成的一些实际测试实例进行了计算研究。我们表明,数学产生合理的解决方案,而商业mip求解器失败,因此可以提供有价值的决策支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.90
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信