
AbstractA vehicle shuttles between two terminals, at which passengers are arriving in a Poisson manner at given rates. Travel time between the stops is assumed deterministic. This paper considers the question of what operating strategy will yield lowest average waiting time for passengers of the system. Exact solutions to the problem are obtained, and it is found that the optimal strategy is a somewhat complex but very tractable function of the two Poisson arrival parameters.
Traffic problems in operations research, Stochastic network models in operations research, Applications of renewal theory (reliability, demand theory, etc.)
Traffic problems in operations research, Stochastic network models in operations research, Applications of renewal theory (reliability, demand theory, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 17 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
