Article ID: | iaor19891135 |
Country: | Japan |
Volume: | J72-A |
Issue: | 8 |
Start Page Number: | 1253 |
End Page Number: | 1259 |
Publication Date: | Aug 1989 |
Journal: | Transactions of the Institute of Electronics, Information and Communication Engineers |
Authors: | Yoneyama Tadaaki, Hamamatsu Yoshio, Kikuchi Shinya |
Keywords: | programming: probabilistic, programming: transportation, transportation: general, markov processes |
A model for the Automated People Mover (APM) is proposed, formulating the behavior of traffic at a grade separated intersection using the Imbedded Markov chain technique. The intersection is composed of overpasses and underpasses and the traffic flow goes the sub-line to the main-line through the off-line. The vehicles going from the sub-line into the main-line must form a queue in order to avoid colliding with the other vehicles of the main-line, but the authors assume that the length of the queue is infinite. They restrict the maximum number of slot slipping to the first vehicle in the queue. In the model, the authors derive the average number of vehicles in the queue, the average waiting time of vehicles and the rate of detour. [In Japanese.]