Quick Estimation of Network Performance Measures Using Associative Memory Techniques

Palavadi Naga and Yueyue Fan

Institute of Transportation Studies, Working Paper Series from Institute of Transportation Studies, UC Davis

Abstract: Many important decision making processes in transportation planning and engineering involve repetitive computation of network performance, measured by total network delay, throughput, network efficiency, etc. The computational complexity imposed by repetitive evaluation of these measures, especially under user equilibrium condition, is a serious obstacle for timely decision making regarding transportation networks. This study applies Associative Memory (AM) techniques, which are conceptually and computationally simple, to quick estimation of these performance measures. The results of the numerical experiments were encouraging and the relative error on an average was found to be less than two percent. Furthermore, the applicability of this approximation method to bilevel network problems is explored through a study on the network recovery problem (NRP), which seeks a quick and effective repairing strategy for disturbed networks following natural or human-induced disasters.

Keywords: Engineering (search for similar items in EconPapers)
Date: 2008-03-01
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.escholarship.org/uc/item/8hd526wh.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:itsdav:qt8hd526wh

Access Statistics for this paper

More papers in Institute of Transportation Studies, Working Paper Series from Institute of Transportation Studies, UC Davis Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().