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

Non-additive shortest path in the context of traffic assignment

Author

Listed:
  • Perederieieva, Olga
  • Raith, Andrea
  • Schmidt, Marie

Abstract

The most commonly used traffic assignment (TA) model is known as user equilibrium, which assumes that all travellers minimise their travel time or generalised cost. In this paper we study a TA problem in which generalised cost is composed of two attributes, for instance travel time and toll combined through a non-linear relation.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:268:y:2018:i:1:p:325-338
    DOI: 10.1016/j.ejor.2018.01.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718300353
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.01.017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Lam, Terence C. & Small, Kenneth A., 0. "The value of time and reliability: measurement from a value pricing experiment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 37(2-3), pages 231-251, April.
    2. Calfee, John & Winston, Clifford, 1998. "The value of automobile travel time: implications for congestion policy," Journal of Public Economics, Elsevier, vol. 69(1), pages 83-102, July.
    3. T. Leventhal & G. Nemhauser & L. Trotter, 1973. "A Column Generation Algorithm for Optimal Traffic Assignment," Transportation Science, INFORMS, vol. 7(2), pages 168-176, May.
    4. Small, Kenneth A., 2001. "The Value of Pricing," University of California Transportation Center, Working Papers qt0rm449sx, University of California Transportation Center.
    5. Tung Tung, Chi & Lin Chew, Kim, 1992. "A multicriteria Pareto-optimal path algorithm," European Journal of Operational Research, Elsevier, vol. 62(2), pages 203-209, October.
    6. 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.
    7. Iori, Manuel & Martello, Silvano & Pretolani, Daniele, 2010. "An aggregate label setting policy for the multi-objective shortest path problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1489-1496, December.
    8. 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.
    9. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    10. Leurent, Fabien, 1993. "Cost versus time equilibrium over a network," European Journal of Operational Research, Elsevier, vol. 71(2), pages 205-221, December.
    11. Lars Hultkrantz & Reza Mortazavi, 2001. "Anomalies in the Value of Travel-Time Changes," Journal of Transport Economics and Policy, University of Bath, vol. 35(2), pages 285-299, May.
    12. Dial, Robert B., 2006. "A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 917-936, December.
    13. 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.
    14. Machuca, E. & Mandow, L. & Pérez de la Cruz, J.L. & Ruiz-Sepulveda, A., 2012. "A comparison of heuristic best-first algorithms for bicriterion shortest path problems," European Journal of Operational Research, Elsevier, vol. 217(1), pages 44-53.
    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. Maryam Eghbal & Farzaneh Nassirzadeh & Davood Askarany, 2024. "The Relationship Between Non-additivity Valuations, Cash Flows and Sales Growth," Computational Economics, Springer;Society for Computational Economics, vol. 64(1), pages 429-459, July.
    2. 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.
    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. Gonghang Chen & Jifeng Cao & Xiangfeng Ji, 2024. "Reliability and Unreliability Aspects of Travel Time Analysis on the Stochastic Network Using the Target-Oriented Perspective," Sustainability, MDPI, vol. 16(12), pages 1-22, June.
    5. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.

    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. Meng, Qiang & Liu, Zhiyuan & Wang, Shuaian, 2012. "Optimal distance tolls under congestion pricing and continuously distributed value of time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 937-957.
    2. 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.
    3. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    4. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    5. Wu, Wen-Xiang & Huang, Hai-Jun, 2014. "Finding anonymous tolls to realize target flow pattern in networks with continuously distributed value of time," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 31-46.
    6. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    7. Yang Liu & Yu (Marco) Nie, 2017. "A Credit-Based Congestion Management Scheme in General Two-Mode Networks with Multiclass Users," Networks and Spatial Economics, Springer, vol. 17(3), pages 681-711, September.
    8. Stephane Hess & Andrew Daly & Maria Börjesson, 2020. "A critical appraisal of the use of simple time-money trade-offs for appraisal value of travel time measures," Transportation, Springer, vol. 47(3), pages 1541-1570, June.
    9. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Rasouli, Soora & Huang, Hai-Jun, 2020. "Tolerance-based column generation for boundedly rational dynamic activity-travel assignment in large-scale networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    10. Button, Kenneth, 2004. "1. The Rationale For Road Pricing: Standard Theory And Latest Advances," Research in Transportation Economics, Elsevier, vol. 9(1), pages 3-25, January.
    11. Yu (Marco) Nie, 2012. "A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem," Transportation Science, INFORMS, vol. 46(1), pages 27-38, February.
    12. Wang, Judith Y.T. & Ehrgott, Matthias & Chen, Anthony, 2014. "A bi-objective user equilibrium model of travel time reliability in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 4-15.
    13. Adler, Martin W. & Ommeren, Jos van & Rietveld, Piet, 2013. "Road congestion and incident duration," Economics of Transportation, Elsevier, vol. 2(4), pages 109-118.
    14. Wang, Aihu & Tang, Yuanhua & Mohmand, Yasir Tariq & Xu, Pei, 2022. "Modifying link capacity to avoid Braess Paradox considering elastic demand," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    15. Small, Kenneth A & Winston, Clifford & Yan, Jia, 2002. "Uncovering the Distribution of Motorists' Preferences for Travel Time and Reliability: Implications for Road Pricing," University of California Transportation Center, Working Papers qt8zd2r34k, University of California Transportation Center.
    16. 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.
    17. Brownstone, David & Small, Kenneth A., 2005. "Valuing time and reliability: assessing the evidence from road pricing demonstrations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(4), pages 279-293, May.
    18. Chen, Bi Yu & Lam, William H.K. & Sumalee, Agachai & Li, Qingquan & Li, Zhi-Chun, 2012. "Vulnerability analysis for large-scale and congested road networks with demand uncertainty," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(3), pages 501-516.
    19. Lei Zhang & Feng xie & David Levinson, 2007. "Illusion of Motion: Variation of Subjective Value of Travel Time on Freeways and Ramp Meters," Working Papers 200903, University of Minnesota: Nexus Research Group.
    20. Brownstone, David & Ghosh, Arindam & Golob, Thomas F. & Kazimi, Camilla & Van Amelsfort, Dirk, 2003. "Drivers' willingness-to-pay to reduce travel time: evidence from the San Diego I-15 congestion pricing project," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(4), pages 373-387, May.

    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:268:y:2018:i:1:p:325-338. 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.