IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v31y1997i1p55-70.html
   My bibliography  Save this article

Sensitivity analysis for the elastic-demand network equilibrium problem with applications

Author

Listed:
  • Yang, Hai

Abstract

This paper presents a general framework and a rigorous approach for the quantitative analysis of the behavior of equilibrium flows with elastic demand when the problem is subjected to perturbations in network characteristics. Explicit expressions of the derivatives of the equilibrium solutions with respect to a variety of parameters associated with the supply and demand functions are derived. The derivative information will be utilized to predict changes in the equilibrium flow pattern and various system performance measures when the demand and performance characteristics of the transportation networks are altered slightly. Three numerical examples drawn from network design, congestion pricing and traffic equilibrium paradoxes are presented to highlight the sensitivity analysis method and its applications.

Suggested Citation

  • Yang, Hai, 1997. "Sensitivity analysis for the elastic-demand network equilibrium problem with applications," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 55-70, February.
    • Handle: RePEc:eee:transb:v:31:y:1997:i:1:p:55-70
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(96)00015-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yang, Hai & Yagar, Sam & Iida, Yasunori & Asakura, Yasuo, 1994. "An algorithm for the inflow control problem on urban freeway networks with user-optimal flows," Transportation Research Part B: Methodological, Elsevier, vol. 28(2), pages 123-139, April.
    2. Jerzy Kyparisis, 1990. "Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers," Mathematics of Operations Research, INFORMS, vol. 15(2), pages 286-298, May.
    3. Lawphongpanich, Siriphong & Hearn, Donald W., 1984. "Simplical decomposition of the asymmetric traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 123-133, April.
    4. Yang, Hai & Yagar, Sam, 1995. "Traffic assignment and signal control in saturated road networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 125-139, March.
    5. Nathan H. Gartner, 1980. "Optimal Traffic Assignment with Elastic Demands: A Review Part II. Algorithmic Approaches," Transportation Science, INFORMS, vol. 14(2), pages 192-208, May.
    6. Yan, Hai & Lam, William H. K., 1996. "Optimal road tolls under conditions of queueing and congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(5), pages 319-332, September.
    7. Yang, Hai & Yagar, Sam, 1994. "Traffic assignment and traffic control in general freeway-arterial corridor systems," Transportation Research Part B: Methodological, Elsevier, vol. 28(6), pages 463-486, December.
    8. Dafermos, Stella & Nagurney, Anna, 1984. "On some traffic equilibrium theory paradoxes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 101-110, April.
    9. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    10. Nathan H. Gartner, 1980. "Optimal Traffic Assignment with Elastic Demands: A Review Part I. Analysis Framework," Transportation Science, INFORMS, vol. 14(2), pages 174-191, May.
    11. Richard Steinberg & Richard E. Stone, 1988. "The Prevalence of Paradoxes in Transportation Equilibrium Problems," Transportation Science, INFORMS, vol. 22(4), pages 231-241, November.
    12. Yuping Qiu & Thomas L. Magnanti, 1989. "Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 14(3), pages 410-432, August.
    Full references (including those not matched with items on IDEAS)

    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. Josefsson, Magnus & Patriksson, Michael, 2007. "Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 4-31, January.
    2. Michael Patriksson, 2004. "Sensitivity Analysis of Traffic Equilibria," Transportation Science, INFORMS, vol. 38(3), pages 258-281, August.
    3. Esteve Codina & Lídia Montero, 2006. "Approximation of the steepest descent direction for the O-D matrix adjustment problem," Annals of Operations Research, Springer, vol. 144(1), pages 329-362, April.
    4. Yan, Hai & Lam, William H. K., 1996. "Optimal road tolls under conditions of queueing and congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(5), pages 319-332, September.
    5. S. Dempe & A. Zemkoho, 2012. "Bilevel road pricing: theoretical analysis and optimality conditions," Annals of Operations Research, Springer, vol. 196(1), pages 223-240, July.
    6. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    7. Yang, Hai & Bell, Michael G. H. & Meng, Qiang, 2000. "Modeling the capacity and level of service of urban transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 255-275, May.
    8. Joakim Ekström & Leonid Engelson & Clas Rydergren, 2009. "Heuristic algorithms for a second-best congestion pricing problem," Netnomics, Springer, vol. 10(1), pages 85-102, April.
    9. Clegg, Janet & Smith, Mike & Xiang, Yanling & Yarrow, Robert, 2001. "Bilevel programming applied to optimising urban transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 41-70, January.
    10. Hong Gao & Kai Liu & Xinchao Peng & Cheng Li, 2020. "Optimal Location of Fast Charging Stations for Mixed Traffic of Electric Vehicles and Gasoline Vehicles Subject to Elastic Demands," Energies, MDPI, vol. 13(8), pages 1-16, April.
    11. Lundgren, Jan T. & Peterson, Anders, 2008. "A heuristic for the bilevel origin-destination-matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 339-354, May.
    12. Yan, Qinglong & Sun, Zhe & Gan, Qijian & Jin, Wen-Long, 2018. "Automatic identification of near-stationary traffic states based on the PELT changepoint detection," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 39-54.
    13. Michael Patriksson & R. Tyrrell Rockafellar, 2003. "Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria," Transportation Science, INFORMS, vol. 37(1), pages 56-68, February.
    14. Li, Changmin & Yang, Hai & Zhu, Daoli & Meng, Qiang, 2012. "A global optimization method for continuous network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1144-1158.
    15. Frédéric Babonneau & Jean-Philippe Vial, 2008. "An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands," Transportation Science, INFORMS, vol. 42(2), pages 249-260, May.
    16. Di, Xuan & He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2014. "Braess paradox under the boundedly rational user equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 86-108.
    17. Yang, Chao & Chen, Anthony, 2009. "Sensitivity analysis of the combined travel demand model with applications," European Journal of Operational Research, Elsevier, vol. 198(3), pages 909-921, November.
    18. Aalami, Soheila & Kattan, Lina, 2022. "Proportionally fair flow markets for transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 24-41.
    19. Geng, Lijun & Lu, Zhigang & He, Liangce & Zhang, Jiangfeng & Li, Xueping & Guo, Xiaoqiang, 2019. "Smart charging management system for electric vehicles in coupled transportation and power distribution systems," Energy, Elsevier, vol. 189(C).
    20. Vo, Khoa D. & Lam, William H.K. & Chen, Anthony & Shao, Hu, 2020. "A household optimum utility approach for modeling joint activity-travel choices in congested road networks," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 93-125.

    More about this item

    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:eee:transb:v:31:y:1997:i:1:p:55-70. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.