IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v159y2004i3p529-544.html
   My bibliography  Save this article

Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities

Author

Listed:
  • Han, Deren
  • Lo, Hong K.

Abstract

No abstract is available for this item.

Suggested Citation

  • Han, Deren & Lo, Hong K., 2004. "Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 159(3), pages 529-544, December.
    • Handle: RePEc:eee:ejores:v:159:y:2004:i:3:p:529-544
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00423-5
    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. Steven A. Gabriel & David Bernstein, 1997. "The Traffic Equilibrium Problem with Nonadditive Path Costs," Transportation Science, INFORMS, vol. 31(4), pages 337-348, November.
    2. Chen, Anthony & Lo, Hong K. & Yang, Hai, 2001. "A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs," European Journal of Operational Research, Elsevier, vol. 135(1), pages 27-41, November.
    3. D.R. Han & H.K. Lo, 2002. "New Alternating Direction Method for a Class of Nonlinear Variational Inequality Problems," Journal of Optimization Theory and Applications, Springer, vol. 112(3), pages 549-560, March.
    4. Sang Nguyen & Clermont Dupuis, 1984. "An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs," Transportation Science, INFORMS, vol. 18(2), pages 185-202, May.
    5. Lo, Hong K. & Chen, Anthony, 2000. "Traffic equilibrium problem with route-specific costs: formulation and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 493-513, August.
    6. Wong, S. C. & Yang, Chao & Lo, Hong K., 2001. "A path-based traffic assignment algorithm based on the TRANSYT traffic model," Transportation Research Part B: Methodological, Elsevier, vol. 35(2), pages 163-181, 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. Zangui, Mahmood & Aashtiani, Hedayat Z. & Lawphongpanich, Siriphong & Yin, Yafeng, 2015. "Path-differentiated pricing in congestion mitigation," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 202-219.
    2. Luan, Jianlin & Polak, John & Krishnan, Rajesh, 2019. "The structure of public-private sector collaboration in travel information markets: A game theoretic analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 19-38.
    3. Luan, Mingye & Waller, S.Travis & Rey, David, 2023. "A non-additive path-based reward credit scheme for traffic congestion management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    4. Ma, Jie & Xu, Min & Meng, Qiang & Cheng, Lin, 2020. "Ridesharing user equilibrium problem under OD-based surge pricing strategy," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 1-24.
    5. Perederieieva, Olga & Raith, Andrea & Schmidt, Marie, 2018. "Non-additive shortest path in the context of traffic assignment," European Journal of Operational Research, Elsevier, vol. 268(1), pages 325-338.
    6. Szeto, W.Y. & Lo, Hong K., 2008. "Time-dependent transport network improvement and tolling strategies," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(2), pages 376-391, February.
    7. Hong-Kun Xu, 2011. "Averaged Mappings and the Gradient-Projection Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 360-378, August.
    8. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    9. František Kolovský & Ivana Kolingerová, 2022. "The Piecewise Constant/Linear Solution for Dynamic User Equilibrium," Networks and Spatial Economics, Springer, vol. 22(4), pages 737-765, December.
    10. Li, Min & Liao, Li-Zhi & Yuan, Xiao-ming, 2008. "A modified descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 189(2), pages 310-323, September.
    11. Siu, Barbara W.Y. & Lo, Hong K., 2008. "Doubly uncertain transportation network: Degradable capacity and stochastic demand," European Journal of Operational Research, Elsevier, vol. 191(1), pages 166-181, November.

    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. Chen, Anthony & Zhou, Zhong & Lam, William H.K., 2011. "Modeling stochastic perception error in the mean-excess traffic equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1619-1640.
    2. Huang, Ruqing & Han, Lee D. & Huang, Zhongxiang, 2022. "A new network equilibrium flow model: User-equilibrium with quantity adjustment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    3. Siu, Barbara W.Y. & Lo, Hong K., 2008. "Doubly uncertain transportation network: Degradable capacity and stochastic demand," European Journal of Operational Research, Elsevier, vol. 191(1), pages 166-181, November.
    4. Luan, Mingye & Waller, S.Travis & Rey, David, 2023. "A non-additive path-based reward credit scheme for traffic congestion management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    5. Chen, Anthony & Lo, Hong K. & Yang, Hai, 2001. "A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs," European Journal of Operational Research, Elsevier, vol. 135(1), pages 27-41, November.
    6. Chen, Anthony & Zhou, Zhong, 2010. "The [alpha]-reliable mean-excess traffic equilibrium model with stochastic travel times," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 493-513, May.
    7. Zhou, Zhong & Chen, Anthony & Wong, S.C., 2009. "Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model," European Journal of Operational Research, Elsevier, vol. 198(1), pages 129-138, October.
    8. Perederieieva, Olga & Raith, Andrea & Schmidt, Marie, 2018. "Non-additive shortest path in the context of traffic assignment," European Journal of Operational Research, Elsevier, vol. 268(1), pages 325-338.
    9. Yao, Jia & Chen, Anthony & Ryu, Seungkyu & Shi, Feng, 2014. "A general unconstrained optimization formulation for the combined distribution and assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 137-160.
    10. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    11. Wang, Judith Y.T. & Ehrgott, Matthias, 2013. "Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 342-360.
    12. Xu, Zhandong & Chen, Anthony & Liu, Xiaobo, 2023. "Time and toll trade-off with heterogeneous users: A continuous time surplus maximization bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 31-58.
    13. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    14. Huang, Hai-Jun & Li, Zhi-Chun, 2007. "A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1464-1477, February.
    15. Teppei Kato & Kenetsu Uchida & William H. K. Lam & Agachai Sumalee, 2021. "Estimation of the value of travel time and of travel time reliability for heterogeneous drivers in a road network," Transportation, Springer, vol. 48(4), pages 1639-1670, August.
    16. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    17. Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
    18. Chi Xie & Xing Wu & Stephen Boyles, 2019. "Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account," Annals of Operations Research, Springer, vol. 273(1), pages 279-310, February.
    19. (Jeff) Ban, Xuegang & Ferris, Michael C. & Tang, Lisa & Lu, Shu, 2013. "Risk-neutral second best toll pricing," Transportation Research Part B: Methodological, Elsevier, vol. 48(C), pages 67-87.
    20. Yang, Hai & Zhang, Xiaoning & Meng, Qiang, 2004. "Modeling private highways in networks with entry-exit based toll charges," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 191-213, March.

    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:ejores:v:159:y:2004:i:3:p:529-544. 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/locate/eor .

    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.