کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1139562 | 1489426 | 2013 | 8 صفحه PDF | دانلود رایگان |

In this paper, a ship lock scheduling problem is investigated. Ships arrive randomly over time, and the instantaneous arrival rates are allowed to vary both temporally and stochastically in an arbitrary manner. A data-driven approach is applied to a single ship lock scheduling, which is a typical optimizing and decision-making problem. The objective is to minimize the operation costs and other costs(e.g. water cost, electricity cost, and staff welfare cost) by selecting an appropriate slot number during a planned period. The convergence of data-driven approach is discussed from three aspects: the convergence of ant colony optimization algorithm, the convergence of the proposed algorithm, and the error between the historical ship data and the current arrival ship data. The research findings are beneficial for the convergence analysis of data-driven theory and the management of waterway transportation.
Journal: Mathematics and Computers in Simulation - Volume 88, February 2013, Pages 31–38