IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i4p736-743.html
   My bibliography  Save this article

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

Author

Listed:
  • Alan L. Erera

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Carlos F. Daganzo

    (Department of Civil and Environmental Engineering, University of California, Berkeley, California 94720)

  • David J. Lovell

    (Department of Civil and Environmental Engineering, University of Maryland, College Park, Maryland 20742)

Abstract

This paper is concerned with the performance of multicommodity capacitated networks in a deterministic but time-dependent environment. For a given time-dependent origin-destination table, this paper asks if it is easy to find a way of regulating the input flows into the network to avoid queues from growing internally, i.e., to avoid capacity violations. Problems of this type are conventionally approached in the traffic/transportation field with variational methods such as control theory (if time is continuous) and with mathematical programming (if time is discrete). However, these approaches can only be expected to work well ifthe set off easible solutions is convex.Unfortunately, it is found in this paper that this is not the case. It is shown that continuous-time versions of the problem satisfying the smoothness conditions of control theory can have a finite but very large number off easible solutions. The same happens for the discrete time case. These difficulties arise even with the simplest versions of the problem (with unique origin-destination paths, perfect information, and deterministic travel times).The paper also shows that the continuous-time feasibility problem is NP-hard, and that if we restrict our attention to (practical) problems whose data can be described with a finite number ofbits (e.g., in discrete time), then the problem is NP-complete. These results are established by showing that the problem instances of interest can be related to the Directed Hamiltonian Path problem by a polynomial transformation.

Suggested Citation

  • Alan L. Erera & Carlos F. Daganzo & David J. Lovell, 2002. "The Access-Control Problem on Capacitated FIFO Networks With Unique O-D Paths is Hard," Operations Research, INFORMS, vol. 50(4), pages 736-743, August.
    • Handle: RePEc:inm:oropre:v:50:y:2002:i:4:p:736-743
    DOI: 10.1287/opre.50.4.736.2863
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.4.736.2863
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.50.4.736.2863?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Muñoz, Juan Carlos & Laval, Jorge A., 2006. "System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination," Transportation Research Part B: Methodological, Elsevier, vol. 40(1), pages 1-15, January.
    2. Zhang, Lei & Levinson, David, 2004. "Optimal freeway ramp control without origin-destination information," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 869-887, December.
    3. Zhang, H.M. & Shen, Wei, 2010. "Access control policies without inside queues: Their properties and public policy implications," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1132-1147, September.

    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:inm:oropre:v:50:y:2002:i:4:p:736-743. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.