Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management[1]

Powell, Warren B.; Carvalho, Tassio A.
May 1998
Transportation Science;May98, Vol. 32 Issue 2, p90
Academic Journal
Dynamic fleet management problems are normally formulated as networks over dynamic networks. Additional realism usually implies the inclusion of complicating constraints, typically producing exceptionally large integer programs. In this paper, we present for the first time the formulation of dynamic fleet management problems in an optimal control setting, using a novel formulation called a Logistics Queueing Network (LQN). This formulation replaces a single, large optimization problem with a series of very small problems that involve little more than solving a single sort at each point in space and time. We show that this approach can produce solutions that are within a few percent of a global optimum but provide for consider- ably more flexibility than standard linear programs.


Related Articles

  • Queue-length distribution for the discriminatory processor-sharing queue. Rege, Kiran M.; Sengupta, Bhaskar // Operations Research;Jul/Aug96, Vol. 44 Issue 4, p653 

    In this paper, we study a multiple class discriminatory processor-sharing queue. The queue is assumed to have Poisson input and exponentially distributed service times. In this discipline there are K classes of customers. When there are n, customers present in the system of class i(i = 1, . . ....

  • An optimal service rate in a Poisson arrival queue with two-stage service policy*. Jongho Bae, O. J.; Jongwoo Kim, O. J.; Eui Yong Lee // Mathematical Methods of Operations Research;2003, Vol. 58 Issue 3, p477 

    We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty....

  • A SIMPLE PROOF OF: L = λW. Jewell, William S. // Operations Research;Nov/Dec67, Vol. 15 Issue 6, p1109 

    A simple proof of the fundamental queuing formula L = λW is given that is based on renewal theory. The basic assumptions that are needed are: (1) the event {system is empty} is recurrent, and (2) the arrival and waiting-time mechanisms are reset by the next arrival after this event occurs.

  • A UNIFIED FAMILY OF SINGLE--SERVER QUEUEING LOCATION MODELS. Brandeau, Margaret L.; Chiu, Samuel S. // Operations Research;Nov/Dec90, Vol. 38 Issue 6, p1034 

    In this paper, we introduce a general class of single-server network location models which includes the median, center, stochastic queue median, stochastic queue center, Lp norm, and other location problems in a single parametric framework. The model incorporates both queueing effects and a cost...

  • AN IMBEDDED CHAIN APPROACH TO A QUEUE WITH MOVING AVERAGE INPUT. Pearce, C. // Operations Research;Nov/Dec67, Vol. 15 Issue 6, p1117 

    A generalization of the GI/M/1 queue is considered in which the interarrival times do not constitute an identically and independently distributed sequence but, are correlated. The transient behavior of the queue length is treated, both in continuous time and on an imbedded chain. The busy period...

  • SCHEDULING NETWORKS OF QUEUES: HEAVY TRAFFIC ANALYSIS OF A TWO-STATION CLOSED NETWORK. Harrison, J. Michael; Wein, Lawrence M. // Operations Research;Nov/Dec90, Vol. 38 Issue 6, p1052 

    We consider a multiclass closed queueing network with two single-server stations. Each class requires service at a particular station, and customers change class after service according to specified probabilities. There is a general service time distribution for each class. The problem is to...

  • QUEUEING THEORY. Heyman, Daniel P. // Encyclopedia of Operations Research & Management Science;2001, p679 

    The article discusses queueing theory. It is the study of service systems with statistical fluctuations in either the arrival or service rates. Queueing theory is related to the stochastic service systems and the theory of mass storage. The paradigm of a queueing model includes a facility...

  • A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals. Shalmon, Michael; Kaplan, Michael A. // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p753 

    We present a complete analysis of delays for a tandem network of queues with deterministic service and multiple, interfering sources. The model is of a packet-based data collection system consisting of some finite, but arbitrary, number of stations connected in tandem by a unidirectional,...

  • The Output of the M/M/s Queue. Everitt, D. E.; Downs, T. // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p796 

    This paper derives an explicit expression for the transient distribution of the output process of the M/M/s queue operating in continuous time. This expression is rather complex and alternative computational techniques are presented. Some computational results are included.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics