Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service Queues

A general class of vehicle dispatching strategies for bulk arrival, bulk service queues is examined which consist of some combination of vehicle holding and cancellation strategies. The moments of the length of the queue at vehicle departure instants and in continuous time are solved for exactly using transform methods. Relationships between the moments of the waiting time and queue length distributions are developed without further use of transforms, resulting in an exact expression for the expected waiting time and an approximation for the variance. A simple approach for calculating the roots of a particular function, needed to find the moments of the queue length distribution, is presented and used to demonstrate that this task can be accomplished very easily. Finally, the model is used to compare alternative vehicle dispatching strategies in terms of costs and levels of service.

[1]  Charles S. Tapiero,et al.  Vehicle dispatching with competition , 1979 .

[2]  R. Serfozo,et al.  Optimal control of batch service queues , 1973, Advances in Applied Probability.

[3]  Warrren B Powell,et al.  The load planning problem of motor carriers: Problem description and a proposed solution approach , 1983 .

[4]  G. F. Newell.  Control of Pairing of Vehicles on a Public Transportation Route, Two Vehicles, One Control Point , 1974 .

[5]  Warren B. Powell,et al.  Bulk service queues with deviations from departure schedules: The problem of correlated headways , 1983 .

[6]  Mark S. Daskin,et al.  Queuing Models of Classification and Connection Delay in Railyards , 1982 .

[7]  G. F. Newell.  Approximation Methods for Queues with Application to the Fixed-Cycle Traffic Light , 1965 .

[8]  Marcel F. Neuts,et al.  Queues Solvable without Rouché's Theorem , 1979, Oper. Res..

[9]  Rupert G. Miller.  A CONTRIBUTION TO THE THEORY OF BULK QUEUES , 1959 .

[10]  G. F. Newell,et al.  Control Strategies for an Idealized Public Transportation System , 1972 .

[11]  Charles S. Tapiero,et al.  Random vehicle dispatching with options and optimal fleet size , 1980 .

[12]  N. K. Jaiswal,et al.  A Bulk‐Service Queueing Problem with Variable Capacity , 1961 .

[13]  Warren B. Powell,et al.  The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure , 1986, Oper. Res..

[14]  M. Neuts.  A General Class of Bulk Queues with Poisson Input , 1967 .

[15]  Daniel J. Kleitman,et al.  Optimal Scheduling Policies for Some Simple Transportation Systems , 1973 .

[16]  Katsuhisa Ohno,et al.  Computational Algorithm for a Fixed Cycle Traffic Signal and New Approximate Expressions for Average Delay , 1978 .

[17]  Donald R. McNeil,et al.  A solution to the fixed-cycle traffic light problem for compound Poisson arrivals , 1968 .

[18]  Norman T. J. Bailey,et al.  On Queueing Processes with Bulk Service , 1954 .

[19]  J. Darroch.  On the Traffic-light Queue , 1964 .

[20]  J. Teghem,et al.  Modèles d'attente M/G/1 et GI/M/1 : à arrivées et services en groupes , 1969 .

[21]  M. Florian.  A Traffic Equilibrium Model of Travel by Car and Public Transit Modes , 1977 .

[22]  F. Downton,et al.  Waiting Time in Bulk Service Queues , 1955 .

[23]  Warren B. Powell,et al.  Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals , 1986, Transp. Sci..