Mingzhu Yu , Haoran Yang , Yaofeng Zhou , Xiaofan Lai , Gangqiao Wang
{"title":"International multimodal transportation optimization considering bulk cargo containerization","authors":"Mingzhu Yu , Haoran Yang , Yaofeng Zhou , Xiaofan Lai , Gangqiao Wang","doi":"10.1016/j.cor.2025.107095","DOIUrl":null,"url":null,"abstract":"<div><div>Bulk cargo containerization helps to reposition empty containers and reduce bulk cargo attrition in international trade. This paper studies an international multimodal transportation optimization problem that considers the containerization of bulk cargo in multiple planning periods. We provide a mathematical formulation for this optimization model, taking into account decisions related to equipment purchasing and bulk cargo containerization quantities. By incorporating the uncertainty of the bulk cargo demand, our basic model is extended to a two-stage stochastic mixed integer programming model. An improved Benders decomposition algorithm is proposed to solve this model. The results of numerical experiments and sensitivity analysis show that: (1) a high bulk cargo loss rate, a large number of nodes in the network, and an extensive planning period motivate carriers to pursue bulk cargo containerization; (2) when the price of the containerization equipment is reasonable, bulk cargo containerization can save costs; (3) the more complex the network, the higher the price of the equipment carriers can afford for bulk cargo containerization; and (4) considering uncertain demand with more demand scenarios can help reduce operational cost.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107095"},"PeriodicalIF":4.1000,"publicationDate":"2025-04-23","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/S0305054825001236","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
Bulk cargo containerization helps to reposition empty containers and reduce bulk cargo attrition in international trade. This paper studies an international multimodal transportation optimization problem that considers the containerization of bulk cargo in multiple planning periods. We provide a mathematical formulation for this optimization model, taking into account decisions related to equipment purchasing and bulk cargo containerization quantities. By incorporating the uncertainty of the bulk cargo demand, our basic model is extended to a two-stage stochastic mixed integer programming model. An improved Benders decomposition algorithm is proposed to solve this model. The results of numerical experiments and sensitivity analysis show that: (1) a high bulk cargo loss rate, a large number of nodes in the network, and an extensive planning period motivate carriers to pursue bulk cargo containerization; (2) when the price of the containerization equipment is reasonable, bulk cargo containerization can save costs; (3) the more complex the network, the higher the price of the equipment carriers can afford for bulk cargo containerization; and (4) considering uncertain demand with more demand scenarios can help reduce operational cost.
期刊介绍:
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.