The fixed cycle traffic light problem: a note on a paper by Mcneil

1970 ◽  
Vol 7 (1) ◽  
pp. 245-248 ◽  
Author(s):  
Victor Siskind
Keyword(s):  
Poisson Process ◽  
Cycle Time ◽  
Compound Poisson Process ◽  
Constant Time ◽  
Traffic Light ◽  
Compound Poisson ◽  
Light Green ◽  
Light Form

Both paper and author (D. R. McNeil, (1968)) will be referred to below as DRM. The said paper deals with the following situation: an intersection is controlled by a traffic light with a fixed cycle time, T; the possibility of other delays, e.g., due to turning vehicles, is ignored; arrivals at the light form a compound Poisson process; if vehicles arrive to find the light green and the queue empty they are not delayed, while in the contrary case they depart when they reach the head of the queue, providing the light is green, each vehicle taking a constant time to move off. The length of the effective red period is R. For further details and discussion, DRM may be consulted.

The fixed cycle traffic light problem: a note on a paper by Mcneil

1970 ◽  
Vol 7 (01) ◽  
pp. 245-248 ◽  
Author(s):  
Victor Siskind
Keyword(s):  
Poisson Process ◽  
Cycle Time ◽  
Compound Poisson Process ◽  
Constant Time ◽  
Traffic Light ◽  
Compound Poisson ◽  
Light Green ◽  
Light Form

Both paper and author (D. R. McNeil, (1968)) will be referred to below as DRM. The said paper deals with the following situation: an intersection is controlled by a traffic light with a fixed cycle time, T; the possibility of other delays, e.g., due to turning vehicles, is ignored; arrivals at the light form a compound Poisson process; if vehicles arrive to find the light green and the queue empty they are not delayed, while in the contrary case they depart when they reach the head of the queue, providing the light is green, each vehicle taking a constant time to move off. The length of the effective red period is R. For further details and discussion, DRM may be consulted.

Approximations for the single-product production-inventory problem with compound Poisson demand and service-level constraints

1984 ◽  
Vol 16 (2) ◽  
pp. 378-401 ◽  
Author(s):  
A. G. De kok ◽  
H. C. Tijms ◽  
F. A. Van der Duyn Schouten
Keyword(s):  
Poisson Process ◽  
Compound Poisson Process ◽  
Service Level ◽  
Inventory Level ◽  
Inventory Problem ◽  
Single Product ◽  
Compound Poisson ◽  
Poisson Demand ◽  
Production Inventory ◽  
Random Fluctuations

We consider a production-inventory problem in which the production rate can be continuously controlled in order to cope with random fluctuations in the demand. The demand process for a single product is a compound Poisson process. Excess demand is backlogged. Two production rates are available and the inventory level is continuously controlled by a switch-over rule characterized by two critical numbers. In accordance with common practice, we consider service measures such as the average number of stockouts per unit time and the fraction of demand to be met directly from stock on hand. The purpose of the paper is to derive practically useful approximations for the switch-over levels of the control rule such that a pre-specified value of the service level is achieved.

Dependent thinning of point processes

1980 ◽  
Vol 17 (04) ◽  
pp. 987-995 ◽  
Author(s):  
Valerie Isham
Keyword(s):  
Poisson Process ◽  
Point Process ◽  
Real Line ◽  
Point Processes ◽  
Compound Poisson Process ◽  
Second Order ◽  
Binary Variables ◽  
Compound Poisson ◽  
The Real ◽  
Markov Sequence

A point process, N, on the real line, is thinned using a k -dependent Markov sequence of binary variables, and is rescaled. Second-order properties of the thinned process are described when k = 1. For general k, convergence to a compound Poisson process is demonstrated.

Sign in / Sign up

Export Citation Format

Share Document