TITLE

On the Existence of Solutions to the Dynamic User Equilibrium Problem

AUTHOR(S)
Daoli Zhu; Marcotte, Patrice
PUB. DATE
November 2000
SOURCE
Transportation Science;Nov2000, Vol. 34 Issue 4, p402
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper is concerned with the existence of solutions to a dynamic network equilibrium problem modeled as an infinite dimensional variational inequality. Our results are based on properties of operators that map path flow departure rates to consistent time-dependent path flows and other link performance functions. The existence result requires the introduction of a novel concept that strengthens the familiar concept of First-In-First-Out (FIFO).
ACCESSION #
4338331

 

Related Articles

  • BROWNIAN APPROXIMATIONS OF MULTICLASS OPEN-QUEUEING NETWORKS. Hong Chen; Xinyang Shen; Yao, David D. // Operations Research;Nov/Dec2002, Vol. 50 Issue 6, p1032 

    We study a multiclass open-queueing network with a set of single-server stations that operate under a combination of FIFO (first-in-first-out) and priority service disciplines, and are subject to random breakdowns. Assuming that the primitive processes--in particular, external arrivals, service...

  • STABILIZING BATCH-PROCESSING NETWORKS. Dai, J. G.; Li, Caiwei // Operations Research;Jan/Feb2003, Vol. 51 Issue 1, p123 

    In a batch-processing network, multiple jobs can be formed into a batch to be processed in a single service operation. The network is multiclass in that several job classes may be processed at a server. Jobs in different classes cannot be mixed into a single batch. A batch policy specifies which...

  • ON THE CONCEPT OF FIFOV IN QUEUES. Krishnamoorthi, B. // Operations Research;May/Jun65, Vol. 13 Issue 3, p365 

    In several queuing situations, the order in which the units depart is not the same as the order in which they arrived at the system. We call this phenomenon, the "Violation of the `First In, First Out' principle" (FIFOV). A quantitative study of FIIFOV is of operational importance in tandem...

  • DUE-DATE SCHEDULING: ASYMPTOTIC OPTIMALITY OF GENERALIZED LONGEST QUEUE AND GENERALIZED LARGEST DELAY RULES. van Mieghem, Jan A. // Operations Research;Jan/Feb2003, Vol. 51 Issue 1, p113 

    Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: Any class k job arriving at time t must be served by its due date t + D [subk]. Equivalently, its delay T[subk] must not exceed a given delay or lead-time D[subk]. In a stochastic system,...

  • THE MARKOVIAN QUEUE WITH BOUNDED WAITING TIME. Gavish, Bezalel; Schweitzer, Paul J. // Management Science;Aug1977, Vol. 23 Issue 12, p1349 

    The single-server queueing system is studied where arrivals are rejected if their waiting plus service times would exceed a fixed amount K. Applications of this model include equipment repair facilities and buffered communication devices with constant discharge rate receiving messages from a...

  • THE QUEUE M/G/1 WITH FEEDBACK TO LOWER PRIORITY QUEUES. Schrage, L. E. // Management Science;Mar67, Vol. 13 Issue 7, p466 

    The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing time of a job is assumed to consist of a sequence of "simple" processing times. There are a countably infinite number of waiting queues, 1, 2, ..., but a single processing facility. A job upon...

  • Job shop scheduling in real-time cases. Li Shugang; Wu Zhiming; Pang Xiaohong // International Journal of Advanced Manufacturing Technology;Oct2005, Vol. 26 Issue 7/8, p870 

    A real-time scheduling algorithm is proposed, that is, to first make a fuzzy classification for the operations of jobs in real-time and then, according to their fuzzy sort, to schedule them with the heuristic. The heuristic is obtained by training a neural network offline with the genetic...

  • Cross-Layer Scheduling with QoS Support over a Distributed Queuing MAC for Wireless LANs. Kartsakli, E.; Alonso-Z├írate, J.; Alonso, L.; Verikoukis, C. // Mobile Networks & Applications;Dec2009, Vol. 14 Issue 6, p709 

    Distributed Queuing Collision Avoidance (DQCA) is an efficient MAC protocol designed for infrastructure Wireless LANs. In this paper, four algorithms are proposed that alter the FIFO scheduling order of DQCA in order to meet specific network requirements. The proposed schemes combine the...

  • The distributional Little's law and its applications. Bertsimas, Dimitris; Nakazato, Daisuke // Operations Research;Mar/Apr95, Vol. 43 Issue 2, p298 

    This paper discusses the distributional Little's law and examines its applications in a variety of queueing systems. The distributional law relates the steady-state distributions of the number in the system (or in the queue) and the time spent in the system (or in the queue) in a queueing system...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics