ADVANCES IN THE CONTINUOUS DYNAMIC NETWORK LOADING PROBLEM

The continuous dynamic network loading problem (CDNLP) attempts to determine, in a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departure rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. In this paper, the authors present a formulation of the CDNLP where travel delays may be nonlinear functions of arc traffic volumes. The authors prove, under a boundedness condition, that there exists a unique solution to the problem and propose for its solution a finite-step algorithm. Some computational results are reported for discretized version of the algorithm.

  • Availability:
  • Corporate Authors:

    Institute for Operations Research and the Management Sciences (INFORMS)

    901 Elkridge Landing Road, Suite 400
    Linthicum, MD  United States  21090-2909
  • Authors:
    • Xu, Y W
    • Wu, J H
    • Florian, M
    • Marcotte, P
    • ZHU, D L
  • Publication Date: 1999-11

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00780033
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Dec 7 1999 12:00AM