Bulk ship fleet scheduling in industrial shipping for multiple destinations with time-variant loading constraints

Zixuan Song , Jian Gang Jin
{"title":"Bulk ship fleet scheduling in industrial shipping for multiple destinations with time-variant loading constraints","authors":"Zixuan Song ,&nbsp;Jian Gang Jin","doi":"10.1016/j.tre.2025.104049","DOIUrl":null,"url":null,"abstract":"<div><div>Bulk carriers are essential in the worldwide transport of raw materials between continents. Most quintessential challenges confronting bulk shipping companies are in regard to the arrangement of ship deployment, voyage assignment, and voyage durations to reduce both operational and capital expenses. To address this issue, a discrete space–time model is designed that integrates fleet sizing and mix, voyage planning, and sailing speed optimization decisions within a cooperative framework in an industrial shipping context. This framework is specifically tailored to industrial shipping with operations involving a single bulk export terminal (BET) and multiple bulk import terminals (BITs) and also takes into account time-dependent handling capability of the BET. The problem is formulated as a mixed-integer programming model, aiming to minimize fleet costs over the planning horizon while adhering to operational constraints and total transport demand. A Lagrangian relaxation-based method was employed to address this problem. Numerical experiments based on a real-world bauxite transportation network demonstrate the validity of the proposed approach. Additionally, sensitivity analyses are conducted to assess the impact of factors such as seasonal variations and unforeseen incidents. The results demonstrate the effectiveness of the method, offering insights for the enhancement of bulk shipping operations management.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"197 ","pages":"Article 104049"},"PeriodicalIF":8.3000,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part E-Logistics and Transportation Review","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1366554525000900","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

Abstract

Bulk carriers are essential in the worldwide transport of raw materials between continents. Most quintessential challenges confronting bulk shipping companies are in regard to the arrangement of ship deployment, voyage assignment, and voyage durations to reduce both operational and capital expenses. To address this issue, a discrete space–time model is designed that integrates fleet sizing and mix, voyage planning, and sailing speed optimization decisions within a cooperative framework in an industrial shipping context. This framework is specifically tailored to industrial shipping with operations involving a single bulk export terminal (BET) and multiple bulk import terminals (BITs) and also takes into account time-dependent handling capability of the BET. The problem is formulated as a mixed-integer programming model, aiming to minimize fleet costs over the planning horizon while adhering to operational constraints and total transport demand. A Lagrangian relaxation-based method was employed to address this problem. Numerical experiments based on a real-world bauxite transportation network demonstrate the validity of the proposed approach. Additionally, sensitivity analyses are conducted to assess the impact of factors such as seasonal variations and unforeseen incidents. The results demonstrate the effectiveness of the method, offering insights for the enhancement of bulk shipping operations management.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
16.20
自引率
16.00%
发文量
285
审稿时长
62 days
期刊介绍: Transportation Research Part E: Logistics and Transportation Review is a reputable journal that publishes high-quality articles covering a wide range of topics in the field of logistics and transportation research. The journal welcomes submissions on various subjects, including transport economics, transport infrastructure and investment appraisal, evaluation of public policies related to transportation, empirical and analytical studies of logistics management practices and performance, logistics and operations models, and logistics and supply chain management. Part E aims to provide informative and well-researched articles that contribute to the understanding and advancement of the field. The content of the journal is complementary to other prestigious journals in transportation research, such as Transportation Research Part A: Policy and Practice, Part B: Methodological, Part C: Emerging Technologies, Part D: Transport and Environment, and Part F: Traffic Psychology and Behaviour. Together, these journals form a comprehensive and cohesive reference for current research in transportation science.
期刊最新文献
Dose free brand spillover always benefit? Procurement outsourcing in co-opetitive supply chains Editorial Board Bulk ship fleet scheduling in industrial shipping for multiple destinations with time-variant loading constraints Modular vehicle routing problem: Applications in logistics Towards cyber-physical internet: A systematic review, fundamental model and future perspectives
×
引用
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