Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/107710
| Title: | Optimal sailing speeds and time windows in inland water transportation operations management : mathematical models and applications | Authors: | Wang, H Liu, Y Jin, Y Wang, S |
Issue Date: | Dec-2023 | Source: | Mathematics, Dec. 2023, v. 11, no. 23, 4747 | Abstract: | Inland waterway transportation plays a pivotal role in advancing economic development and nurturing sustainable progress. It serves as a vital conduit linking communities, industries, and markets, thereby facilitating the seamless flow of essential commodities and fostering regional integration. However, in today’s era, marked by a resolute commitment to environmental responsibility and sustainability, inland shipping confronts formidable challenges, particularly pertaining to emission pollution and the escalating costs of fuel. These challenges represent significant impediments to the pursuit of environmentally conscious and sustainable growth by shipping companies. This research endeavor is geared towards the creation of a mathematical model that takes into account various factors, including the types of waterways, temporal constraints, and punctual arrival at the port of discharge. The primary objective is to empower shipping companies to make informed decisions about optimal sailing speeds and the most opportune time windows for entering one-way waterway segments. This, in turn, leads to reductions in fuel costs and waiting times for shipping companies, all while achieving cost minimization and mitigating emissions issues in inland waterway transportation. Ultimately, this research advances the cause of green and sustainable development in the inland waterway shipping sector. Specifically, this study focuses on routes that involve the dynamic transition between one-way and two-way segments. To accomplish this, an integer programming (IP) model is proposed to meticulously analyze the ideal sailing speed for each segment of the route and determine the optimal windows for accessing single-direction channels, thus representing a multistage decision-making process. Meanwhile, the model’s reliability is substantiated through a rigorous comparative assessment against three benchmark strategies (EAS, LAS, and MAS). In our experiments, the optimization model yielded a total cost for the entire inland waterway amounting to $80,626.20. This figure stands below the total costs of $87,118.14 under the EAS strategy and $83,494.70 under the MAS strategy (the LAS strategy failed to meet the port of discharge deadline), thereby conclusively validating its ability to guide vessels to their port of discharge within prescribed schedules, all while reducing overall operational costs and promoting sustainable and environmentally responsible practices. | Keywords: | Integer programming Shipping operations management Sustainability Vessel scheduling |
Publisher: | MDPI | Journal: | Mathematics | EISSN: | 2227-7390 | DOI: | 10.3390/math11234747 | Rights: | © 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). The following publication Wang H, Liu Y, Jin Y, Wang S. Optimal Sailing Speeds and Time Windows in Inland Water Transportation Operations Management: Mathematical Models and Applications. Mathematics. 2023; 11(23):4747 is available at https://doi.org/10.3390/math11234747. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| mathematics-11-04747.pdf | 430.43 kB | Adobe PDF | View/Open |
Page views
59
Citations as of Nov 10, 2025
Downloads
30
Citations as of Nov 10, 2025
SCOPUSTM
Citations
4
Citations as of Dec 19, 2025
WEB OF SCIENCETM
Citations
3
Citations as of Dec 18, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



