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

Alan L. Erera, Carlos F. Daganzo and David J. Lovell

Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley

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.

Keywords: Engineering (search for similar items in EconPapers)
Date: 1999-11-01
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/4cp6j7gf.pdf;origin=repeccitec (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cdl:itsrrp:qt4cp6j7gf

Access Statistics for this paper

More papers in Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().