2014 HiMCM A题特等奖学生论文下载4671
下载方式见文末
论文摘要如下:
Summary
During our investigation of this situation, our team aimed to build an optimization model to analyze and minimize the unloading time of trains. To achieve this goal, we put forward two models, the mathematical model based on queuing theory and the simulation model based on cellular automaton model. Two models proved each other very well.
We first built our mathematical model, in which the exiting process is divided into four time periods: alighting, walking on platforms, queuing, and walking on staircases. We used the knowledge of former research and d/d/s queuing model in order to calculate the time of the four periods. Using this model, we determined that when there are two staircases, each stair of which contains 2 passengers, the total unloading time for one train is around 261 seconds, while that for two trains is approximately 498 seconds.
In addition, we adopted a simulation approach based on cellular automaton model. Different from the mathematical model, the simulation model simulated several periods of unloading processes as a complete process, and considered the effects of congestion on the moving speed and moving rule of passengers. In addition, the model could visualize the simulation process. The simulation model gave the approximately same result as the mathematical model: the unloading time for one train is 251 seconds, while that for two train is 498 seconds. The results convinced us that both of our models are reliable and accurate.
To understand the effect of different factors, we changed variables such as the number of trains arriving, the location and number of staircases, and the capacity of each staircase to see their impact on unloading time. Running our simulation model, we found that: the most effective way to minimize the unloading time is to increase the number of staircases; the capacity of the staircase is also a very important factor; the location of staircases does not affect the unloading time very much.
© 2024. All Rights Reserved. 沪ICP备2023009024号-1