Optimal planning for container prestaging, discharging, and loading processes at seaport rail terminals with uncertainty
This paper considers the optimal planning problem for container prestaging and dynamic discharging/loading at seaport rail terminals subject to uncertainties. The authors formulate the problem into a stochastic dynamic programming model to minimise the total logistics cost. Four simplified strategies are proposed. Experiments based on a real case study are performed to compare the optimal strategy with four simplified strategies in terms of cost, computing time and practicality. Results show that the seaport can use prestaging to reduce the cost involved and that an appropriate discharging/loading plan can be created in response to different prestaging situations and uncertain scenarios.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
-
Supplemental Notes:
- © 2018 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
-
Authors:
- Xie, Ying
- Song, Dong-ping
- Publication Date: 2018-11
Language
- English
Media Info
- Media Type: Web
- Features: Appendices; Figures; References; Tables;
- Pagination: pp 88-109
-
Serial:
- Transportation Research Part E: Logistics and Transportation Review
- Volume: 119
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 1366-5545
- Serial URL: http://www.sciencedirect.com/science/journal/13665545
Subject/Index Terms
- TRT Terms: Container handling; Dynamic programming; Loading and unloading; Logistics; Optimization; Seaports; Stochastic programming; Uncertainty
- Subject Areas: Freight Transportation; Marine Transportation; Planning and Forecasting; Terminals and Facilities;
Filing Info
- Accession Number: 01686505
- Record Type: Publication
- Files: TRIS
- Created Date: Nov 26 2018 10:05AM