A GRASP-based multi-objective approach for the tuna purse seine fishing fleet routing problem

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-11-05 DOI:10.1016/j.cor.2024.106891
Igor Granado , Elsa Silva , Maria Antónia Carravilla , José Fernando Oliveira , Leticia Hernando , Jose A. Fernandes-Salvador
{"title":"A GRASP-based multi-objective approach for the tuna purse seine fishing fleet routing problem","authors":"Igor Granado ,&nbsp;Elsa Silva ,&nbsp;Maria Antónia Carravilla ,&nbsp;José Fernando Oliveira ,&nbsp;Leticia Hernando ,&nbsp;Jose A. Fernandes-Salvador","doi":"10.1016/j.cor.2024.106891","DOIUrl":null,"url":null,"abstract":"<div><div>Nowadays, the world’s fishing fleet uses 20% more fuel to catch the same amount of fish compared to 30 years ago. Addressing this negative environmental and economic performance is crucial due to stricter emission regulations, rising fuel costs, and predicted declines in fish biomass and body sizes due to climate change. Investment in more efficient engines, larger ships and better fuel has been the main response, but this is only feasible in the long term at high infrastructure cost. An alternative is to optimize operations such as the routing of a fleet, which is an extremely complex problem due to its dynamic (time-dependent) moving target characteristics. To date, no other scientific work has approached this problem in its full complexity, i.e., as a dynamic vehicle routing problem with multiple time windows and moving targets. In this paper, two bi-objective mixed linear integer programming (MIP) models are presented, one for the static variant and another for the time-dependent variant. The bi-objective approaches allow to trade off the economic (e.g., probability of high catches) and environmental (e.g., fuel consumption) objectives. To overcome the limitations of exact solutions of the MIP models, a greedy randomized adaptive search procedure for the multi-objective problem (MO-GRASP) is proposed. The computational experiments demonstrate the good performance of the MO-GRASP algorithm with clearly different results when the importance of each objective is varied. In addition, computational experiments conducted on historical data prove the feasibility of applying the MO-GRASP algorithm in a real context and explore the benefits of joint planning (collaborative approach) compared to a non-collaborative strategy. Collaborative approaches enable the definition of better routes that may select slightly worse fishing and planting areas (2.9%), but in exchange for a significant reduction in fuel consumption (17.3%) and time at sea (10.1%) compared to non-collaborative strategies. The final experiment examines the importance of the collaborative approach when the number of available drifting fishing aggregation devices (dFADs) per vessel is reduced.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106891"},"PeriodicalIF":4.1000,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003630","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Nowadays, the world’s fishing fleet uses 20% more fuel to catch the same amount of fish compared to 30 years ago. Addressing this negative environmental and economic performance is crucial due to stricter emission regulations, rising fuel costs, and predicted declines in fish biomass and body sizes due to climate change. Investment in more efficient engines, larger ships and better fuel has been the main response, but this is only feasible in the long term at high infrastructure cost. An alternative is to optimize operations such as the routing of a fleet, which is an extremely complex problem due to its dynamic (time-dependent) moving target characteristics. To date, no other scientific work has approached this problem in its full complexity, i.e., as a dynamic vehicle routing problem with multiple time windows and moving targets. In this paper, two bi-objective mixed linear integer programming (MIP) models are presented, one for the static variant and another for the time-dependent variant. The bi-objective approaches allow to trade off the economic (e.g., probability of high catches) and environmental (e.g., fuel consumption) objectives. To overcome the limitations of exact solutions of the MIP models, a greedy randomized adaptive search procedure for the multi-objective problem (MO-GRASP) is proposed. The computational experiments demonstrate the good performance of the MO-GRASP algorithm with clearly different results when the importance of each objective is varied. In addition, computational experiments conducted on historical data prove the feasibility of applying the MO-GRASP algorithm in a real context and explore the benefits of joint planning (collaborative approach) compared to a non-collaborative strategy. Collaborative approaches enable the definition of better routes that may select slightly worse fishing and planting areas (2.9%), but in exchange for a significant reduction in fuel consumption (17.3%) and time at sea (10.1%) compared to non-collaborative strategies. The final experiment examines the importance of the collaborative approach when the number of available drifting fishing aggregation devices (dFADs) per vessel is reduced.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 GRASP 的金枪鱼围网捕鱼船队路线问题多目标方法
与 30 年前相比,如今全球捕鱼船队捕获相同数量的鱼要多用 20% 的燃料。由于更严格的排放法规、不断上涨的燃料成本以及气候变化导致鱼类生物量和体型下降的预测,解决这种不利的环境和经济表现至关重要。投资更高效的发动机、更大的船舶和更好的燃料一直是主要的应对措施,但这只能在基础设施成本较高的情况下长期可行。另一种办法是优化船队航线等操作,由于船队具有动态(随时间变化)移动目标的特点,这是一个极其复杂的问题。迄今为止,还没有任何其他科学工作从其复杂性的角度,即作为一个具有多个时间窗口和移动目标的动态车辆路由问题,来研究这个问题。本文提出了两个双目标混合线性整数编程(MIP)模型,一个用于静态变量,另一个用于随时间变化的变量。双目标方法允许在经济目标(如高捕获概率)和环境目标(如燃料消耗)之间进行权衡。为了克服 MIP 模型精确解法的局限性,提出了一种针对多目标问题的贪婪随机自适应搜索程序(MO-GRASP)。计算实验证明,MO-GRASP 算法性能良好,当每个目标的重要性不同时,结果也明显不同。此外,对历史数据进行的计算实验证明了在实际环境中应用 MO-GRASP 算法的可行性,并探索了联合规划(协作方法)与非协作策略相比的优势。与非协作策略相比,协作方法能够定义更好的路线,但可能会选择稍差的捕鱼区和种植区(2.9%),但换来的是燃料消耗(17.3%)和海上时间(10.1%)的显著减少。最后一项实验检验了当每艘船可用的漂流集鱼装置(dFADs)数量减少时协作方法的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Understand your decision rather than your model prescription: Towards explainable deep learning approaches for commodity procurement Airline recovery problem under disruptions: A review A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations Scheduling AMSs with generalized Petri nets and highly informed heuristic search Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1