Premium
A Model for Merging Sections in Transportation Systems and Its Analysis
Author(s) -
HOSHINO TAKAHIRO,
TIAN CHUAN,
KOMURO TAKAFUMI,
TSUBOI KAZUHIRO,
HAMAMATSU YOSHIO
Publication year - 2016
Publication title -
electronics and communications in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.131
H-Index - 13
eISSN - 1942-9541
pISSN - 1942-9533
DOI - 10.1002/ecj.11834
Subject(s) - queue , inflow , queueing theory , line (geometry) , section (typography) , computer science , markov chain , relation (database) , traffic flow (computer networking) , flow (mathematics) , real time computing , simulation , mathematical optimization , mathematics , computer network , data mining , mechanics , geometry , machine learning , operating system , physics
SUMMARY This paper proposes a model for merging sections in transportation systems and then analyzes traffic flow under this model. For this analysis, vehicles are represented by an idealized model based on a Markov chain model. Vehicles arrive at the merging section randomly in either of two inflow lines. When a vehicle arrives at the merging section, if no vehicle is present in the other line, then the vehicle must wait in order to connect with another vehicle on the other line before entering. In this merging section model, the queue length is restricted according to the travel time from the origin to destination. The mean queue length and mean queuing delay at the two inflow lines are explicitly derived here. The relation between the maximum queue length and the behavior of traffic is examined, and the obtained results clarify some characteristics of the proposed model.