A Simulation-Based Dynamic Programming Method for Interchange Scheduling of Port Collecting and Distributing Network
Đã lưu trong:
| Xuất bản năm: | Journal of Advanced Transportation vol. 2018 (2018) |
|---|---|
| Tác giả chính: | |
| Tác giả khác: | , , , , |
| Được phát hành: |
John Wiley & Sons, Inc.
|
| Những chủ đề: | |
| Truy cập trực tuyến: | Citation/Abstract Full Text Full Text - PDF |
| Các nhãn: |
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Bài tóm tắt: | As one of the effective methods to reduce congestion, grade intersection has already been changed to interchange in port collecting and distributing network (PCDN) of many Chinese ports, since the first interchange was built in the PCDN of Dalian port in 1924. Due to the growing demand for port freight transportation, congestion in PCDN is becoming one of the inevitable problems that need to be solved. This paper addresses the best interchange scheduling multistage decision problem in PCDN at a network level. The main challenges are how to estimate the delay time and cope with high uncertainties in port network and PCDN. Therefore, a simulation-based dynamic programming (DP) model is proposed with the purpose of minimizing total cost in lifetime period by combining a DP model and two nested simulation models together. Two simulation models are built to figure out the delay cost in the optimization model, which cannot be calculated by mathematical analysis due to complex vehicle travel patterns and irregular traffic volume caused by random events, such as the arrival pattern of ships’, natural conditions, and storage period of cargos. Finally, a real project in northern China is presented as a case study. The proposed method can be applied in similar cases and can help solve analogous complicated multistage problems. |
|---|---|
| số ISSN: | 0197-6729 2042-3195 0018-1501 |
| DOI: | 10.1155/2018/4805250 |
| Nguồn: | ABI/INFORM Global |