Abstract
This paper aims to provide an optimal shipping schedule for steel-manufacturing plants cluster alongside the Yangtze River by developing a mixed integer programming formulation. The model takes into account the multi-layer shipping network on the Yangtze River, the dynamic iron ore price and transportation costs, and the timely demands of steel plants over multiple periods. By applying the proposed model to a real-world case, several interesting findings are observed, leading to further useful managerial insights. We also propose an exact solution approach based on a dynamic programming algorithm to a special case of this problem motivated by real-world practice.
| Original language | English |
|---|---|
| Pages (from-to) | 198-210 |
| Number of pages | 13 |
| Journal | Transportation Research Part E: Logistics and Transportation Review |
| Volume | 122 |
| DOIs | |
| Publication status | Published - Feb 2019 |
Keywords
- Bulk shipping
- Dynamic programming algorithm
- Scenario analysis
- Ship routing and scheduling optimization
ASJC Scopus subject areas
- Business and International Management
- Civil and Structural Engineering
- Transportation
Fingerprint
Dive into the research topics of 'Ship routing and scheduling problem for steel plants cluster alongside the Yangtze River'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver