Simulation of queue with cyclic service in signalized intersection system

(1) * Muhammad Dermawan Mulyodiputro Mail (Universitas Gadjah Mada, Indonesia)
(2) Subanar Subanar Mail (Universitas Gadjah Mada, Indonesia)
*corresponding author

Abstract


The simulation was implemented by modeling the queue with cyclic service in the signalized intersection system. The service policies used in this study were exhaustive and gated, the model was the M/M/1 queue, the arrival rate used was Poisson distribution and the services rate used was Exponential distribution. In the gated service policy, the server served only vehicles that came before the green signal appears at an intersection. Considered that there were 2 types of exhaustive policy in the signalized intersection system, namely normal exhaustive (vehicles only served during the green signal was still active), and exhaustive (there was the green signal duration addition at the intersection, when the green signal duration at an intersection finished). The results of this queueing simulation program were to obtain characteristics and performance of the system, i.e. average number of vehicles and waiting time of vehicles in the intersection and in the system, as well as system utilities. Then from these values, it would be known which of the cyclic service policies (normal exhaustive, exhaustive and gated) was the most suitable when applied to a signalized intersection system

Keywords


Cyclic service; Exhaustive; Normal exhaustive; Gated; Signalized intersection system

   

DOI

https://doi.org/10.26555/ijain.v1i1.15
      

Article metrics

Abstract views : 623 | PDF views : 391

   

Cite

   

Full Text

Download

References


M.A.A. Boon, I.J.B.F. Adan, E.M.M. Winands, and D.G. Down, “Delays at Signalised Intersections with Exhaustive Traffic Control,” European Network of Excellence Euro-NF, 2011.

M.A.A. Boon, R.D. van der Mei, E.M.M. Winands, “Applications of Polling Systems,” Surveys in Operations Research and Management Science, vol. 16, pp. 67-82, July 2011.

Onno J. Boxma, “Queuing Theory,” Images of SMC Research, Stichting Mathematisch Centrum: p. 221-231, 1996.

S.M. Ross, Introduction to Probability Models, Ninth Edition, Elsevier Inc., California, 2007.

Sem C. Borst, Onno J. Boxma, and Hanoch Levy, “The Use of Service Limits for Efficient Operation of Multistation Single-Medium Communication Systems,” IEEE/ACM Transactions on Networking (TON), vol. 3, p. 602-612, Oct. 1995.




Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

___________________________________________________________
International Journal of Advances in Intelligent Informatics
ISSN 2442-6571  (print) | 2548-3161 (online)
Organized by Informatics Department - Universitas Ahmad Dahlan , and UTM Big Data Centre - Universiti Teknologi Malaysia
Published by Universitas Ahmad Dahlan
W : http://ijain.org
E : info@ijain.org, andri.pranolo@tif.uad.ac.id (paper handling issues)
     ijain@uad.ac.id, andri.pranolo.id@ieee.org (publication issues)

View IJAIN Stats

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0