Walking-Distance Introduced Queueing Theory

  • Authors:

  • Daichi Yanagisawa;Akiyasu Tomoeda;Ayako Kimura;Katsuhiro Nishinari

  • Affiliations:

  • Department of Aeronautics and Astronautics, School of Engineering, The University of Tokyo, and JSPS Research Fellow,;Department of Aeronautics and Astronautics, School of Engineering, The University of Tokyo,;Department of Aeronautics and Astronautics, School of Engineering, The University of Tokyo,;Department of Aeronautics and Astronautics, School of Engineering, The University of Tokyo, and PRESTO, Japan Science and Technology Corporation, , Tokyo, Japan 113-8656

  • Venue:
  • ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce the effect of delay in walking from the head of the queue to the service windows in the queueing theory, and obtain the suitable type of queueing system under various conditions. When there are plural service windows, the queueing theory indicates that a fork-type queue, which collects people into a single queue, is more efficient than a parallel-type queue, i.e., queues for each service windows. However, in the walking-distance introduced queueing theory, we find that the parallel-type queue is more efficient when sufficiently many people are waiting in queues, and service time is shorter than walking time. We also consider the situation where there are two kinds of people, whose service time is short and long. The analytical result says that we can decrease people's waiting time and their stress by setting up queues for each kind of people separately.