A simple problem of decision and a waiting time problem. (Spanish. English summary) Zbl 0733.60116

Summary: The travel from P to Q can be achieved by different lines of buses, passing the bus stop P according to a given Poisson distribution and having different velocities. We analyze the strategy for a passenger arriving at random at P in order to arrive at Q in the minimum of time. We also consider a problem of waiting time at P when the buses follow processes which are not Poisson.


60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
90B06 Transportation, logistics and supply chain management
90B20 Traffic problems in operations research
90B35 Deterministic scheduling theory in operations research
91A35 Decision theory for games
Full Text: DOI EuDML


[1] FELLER, W.An Introduction to Probability theory and its Applications, John Willey, New York. Vol I, 1950. Vol. II, 1966. · Zbl 0039.13201
[2] LEVINE ARNOLD. (1971).Theory of Probability, Addison-Wesley Publishing Co. Reading, Mass (U.S.A.). · Zbl 0226.60002
[3] OSUNA, E.E. y NEWLL, G.F. (1972). Control strategies of an idealized public transportation system. Transportation Science, Vol.6, 52–72. · doi:10.1287/trsc.6.1.52
[4] RIOS, S. (1967).Métodos Estadísticos. McGraw-Hill, New York.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.