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

Quick Estimation of Network Performance Measures Using Associative Memory Techniques

Author

Listed:
  • Naga, Palavadi
  • Fan, Yueyue

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.

Suggested Citation

  • Naga, Palavadi & Fan, Yueyue, 2008. "Quick Estimation of Network Performance Measures Using Associative Memory Techniques," Institute of Transportation Studies, Working Paper Series qt8hd526wh, Institute of Transportation Studies, UC Davis.
    • Handle: RePEc:cdl:itsdav:qt8hd526wh
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Yang, Hai & Bell, Michael G. H., 2001. "Transport bilevel programming problems: recent methodological advances," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 1-4, January.
    2. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    3. Kalaba, R. & Lichtenstein, Z. & Tesfatsion, L., 1989. "Linear And Nonlinear Associative Memories For Parameter Estimation," Papers m8913, Southern California - Department of Economics.
    4. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    5. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Milad Zamanifar & Seyed Mohammad Seyedhoseyni, 2017. "Recovery planning model for roadways network after natural hazards," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 87(2), pages 699-716, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gao, Ziyou & Sun, Huijun & Shan, Lian Long, 2004. "A continuous equilibrium network design model and algorithm for transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 235-250, March.
    2. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    3. Guo, Jianhua & Kong, Ye & Li, Zongzhi & Huang, Wei & Cao, Jinde & Wei, Yun, 2019. "A model and genetic algorithm for area-wide intersection signal optimization under user equilibrium traffic," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 155(C), pages 92-104.
    4. Clark, Stephen D. & Watling, David P., 2002. "Sensitivity analysis of the probit-based stochastic user equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 617-635, August.
    5. Di, Xuan & Ma, Rui & Liu, Henry X. & Ban, Xuegang (Jeff), 2018. "A link-node reformulation of ridesharing user equilibrium with network design," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 230-255.
    6. Ukkusuri, Satish V. & Patil, Gopal, 2009. "Multi-period transportation network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 625-642, July.
    7. Tadashi Yamada & Bona Frazila Russ & Jun Castro & Eiichi Taniguchi, 2009. "Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications," Transportation Science, INFORMS, vol. 43(2), pages 129-143, May.
    8. Rui Ding & Norsidah Ujang & Hussain Bin Hamid & Mohd Shahrudin Abd Manan & Rong Li & Safwan Subhi Mousa Albadareen & Ashkan Nochian & Jianjun Wu, 2019. "Application of Complex Networks Theory in Urban Traffic Network Researches," Networks and Spatial Economics, Springer, vol. 19(4), pages 1281-1317, December.
    9. Wang, Shuaian & Meng, Qiang & Yang, Hai, 2013. "Global optimization methods for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 42-60.
    10. Ping Josephine Xu & Russell Allgor & Stephen C. Graves, 2009. "Benefits of Reevaluating Real-Time Order Fulfillment Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 340-355, January.
    11. Dong, Keqiang & Zhang, Hong & Gao, You, 2017. "Dynamical mechanism in aero-engine gas path system using minimum spanning tree and detrended cross-correlation analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 363-369.
    12. Wang, Wei & Cai, Meng & Zheng, Muhua, 2018. "Social contagions on correlated multiplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 121-128.
    13. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware & Alysia M. Wilson, 2004. "UPS Optimizes Its Air Network," Interfaces, INFORMS, vol. 34(1), pages 15-25, February.
    14. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    15. Yunda Dong, 2021. "Weak convergence of an extended splitting method for monotone inclusions," Journal of Global Optimization, Springer, vol. 79(1), pages 257-277, January.
    16. Bokwon Lee & Kyu-Min Lee & Jae-Suk Yang, 2019. "Network structure reveals patterns of legal complexity in human society: The case of the Constitutional legal network," PLOS ONE, Public Library of Science, vol. 14(1), pages 1-15, January.
    17. Accominotti, Olivier & Lucena-Piquero, Delio & Ugolini, Stefano, 2023. "Intermediaries’ substitutability and financial network resilience: A hyperstructure approach," Journal of Economic Dynamics and Control, Elsevier, vol. 153(C).
    18. Hadas, Yuval & Laor, Amir, 2013. "Network design model with evacuation constraints," Transportation Research Part A: Policy and Practice, Elsevier, vol. 47(C), pages 1-9.
    19. K. Ramacandra Rao & Subhro Mitra & Joseph Szmerekovsky, 2021. "Bus Transit Network Structure Selection With Multiple Objectives," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 12(4), pages 1-13, October.
    20. Gao, Yan-Li & Chen, Shi-Ming & Nie, Sen & Ma, Fei & Guan, Jun-Jie, 2018. "Robustness analysis of interdependent networks under multiple-attacking strategies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 495-504.

    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:itsdav:qt8hd526wh. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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/itucdus.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.