IDEAS home Printed from https://ideas.repec.org/p/cdl/itsrrp/qt4cp6j7gf.html
   My bibliography  Save this paper

The Access Control Problem on Capacitated FIFO Networks with Unique O-D Paths is Hard

Author

Listed:
  • Erera, Alan L.
  • Daganzo, Carlos F.
  • Lovell, David J.

Abstract

This paper is concerned with the performance of multi-commodity capacitated networks with continuous flows in a deterministic but time-dependent environment. For a given time-dependent origin-destination (O-D) table, it asks if it is easy to find a way of regulating the input flows into the network so as to avoid queues from growing in it. It is shown that even if the network structure is very simple (unique O-D paths) finding a feasible regulation scheme is a `hard' problem. More specifically, it is shown that even if all input functions are smooth, there are instances of the problem with a finite but possibly very large number of solutions. Furthermore, finding whether a particular instance of the problem has one feasible solution is an NP-hard problem because it is related to the Directed Hamiltonian Path problem of graph theory by a polynomial transformation. It is also shown that the discrete-time version of the problem is NP-complete.

Suggested Citation

  • Erera, Alan L. & Daganzo, Carlos F. & Lovell, David J., 1999. "The Access Control Problem on Capacitated FIFO Networks with Unique O-D Paths is Hard," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt4cp6j7gf, Institute of Transportation Studies, UC Berkeley.
    • Handle: RePEc:cdl:itsrrp:qt4cp6j7gf
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/4cp6j7gf.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Engineering;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cdl:itsrrp:qt4cp6j7gf. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucbus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.