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

Proportionally fair flow markets for transportation networks

Author

Listed:
  • Aalami, Soheila
  • Kattan, Lina

Abstract

The concept of proportionally fair markets for transportation networks is studied. The goal is to find methods for flow allocation to origin/destination pairs in urban communities which is fair, efficient, and able to dynamically adapt to the changes in origin/destinations and traffic network. Two flow markets are designed and studied. Distributed and dynamic algorithms are developed to find the proportional fair allocation of flow among competing origin/destinations. Additionally, existence, uniqueness and stability of the equilibrium points are proved for both markets. Our numerical simulations supplement the stability and practicality of our proposed algorithms.

Suggested Citation

  • Aalami, Soheila & Kattan, Lina, 2022. "Proportionally fair flow markets for transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 24-41.
    • Handle: RePEc:eee:transb:v:157:y:2022:i:c:p:24-41
    DOI: 10.1016/j.trb.2021.12.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261521002368
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2021.12.012?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. Deepak K. Merchant & George L. Nemhauser, 1978. "Optimality Conditions for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 12(3), pages 200-207, August.
    2. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    3. Lam, William H.K. & Shao, Hu & Sumalee, Agachai, 2008. "Modeling impacts of adverse weather conditions on a road network with uncertainties in demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 890-910, December.
    4. Bjarne Grimstad & Brage R. Knudsen, 2020. "Mathematical programming formulations for piecewise polynomial functions," Journal of Global Optimization, Springer, vol. 77(3), pages 455-486, July.
    5. Smith, M. J., 1983. "The existence and calculation of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 17(4), pages 291-303, August.
    6. 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.
    7. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions," Operations Research, INFORMS, vol. 58(2), pages 303-315, April.
    8. Sumalee, Agachai & Xu, Wei, 2011. "First-best marginal cost toll for a traffic network with stochastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 41-59, January.
    9. Yang, Hai & Yang, Teng, 2011. "Equilibrium properties of taxi markets with search frictions," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 696-713, May.
    10. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    11. Yang, Hai & Bell, Michael G. H., 1997. "Traffic restraint, road pricing and network equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 303-314, August.
    12. Fleurbaey, Marc, 2012. "Fairness, Responsibility, and Welfare," OUP Catalogue, Oxford University Press, number 9780199653591.
    13. Bell, Michael G. H. & Cassir, Chris, 2002. "Risk-averse user equilibrium traffic assignment: an application of game theory," Transportation Research Part B: Methodological, Elsevier, vol. 36(8), pages 671-681, September.
    14. Li, Zhi-Chun & Lam, William H.K. & Wong, S.C. & Fu, Xiaowen, 2010. "Optimal route allocation in a liberalizing airline market," Transportation Research Part B: Methodological, Elsevier, vol. 44(7), pages 886-902, August.
    15. Xiao, Feng & Yang, Hai & Han, Deren, 2007. "Competition and efficiency of private toll roads," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 292-308, March.
    16. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "A model and an algorithm for the dynamic traffic assignment problems," LIDAM Reprints CORE 346, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    18. Yang, Hai & Zhang, Xiaoning & Meng, Qiang, 2007. "Stackelberg games and multiple equilibrium behaviors on networks," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 841-861, October.
    19. 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.
    20. Deepak K. Merchant & George L. Nemhauser, 1978. "A Model and an Algorithm for the Dynamic Traffic Assignment Problems," Transportation Science, INFORMS, vol. 12(3), pages 183-199, August.
    21. 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.
    22. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "Optimality conditions for a dynamic traffic assignment model," LIDAM Reprints CORE 345, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Long, Jiancheng & Wang, Chao & Szeto, W.Y., 2018. "Dynamic system optimum simultaneous route and departure time choice problems: Intersection-movement-based formulations and comparisons," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 166-206.
    2. Ban, Xuegang (Jeff) & Pang, Jong-Shi & Liu, Henry X. & Ma, Rui, 2012. "Continuous-time point-queue models in dynamic network loading," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 360-380.
    3. Lu, Gongyuan & Nie, Yu(Marco) & Liu, Xiaobo & Li, Denghui, 2019. "Trajectory-based traffic management inside an autonomous vehicle zone," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 76-98.
    4. Ban, Xuegang (Jeff) & Pang, Jong-Shi & Liu, Henry X. & Ma, Rui, 2012. "Modeling and solving continuous-time instantaneous dynamic user equilibria: A differential complementarity systems approach," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 389-408.
    5. Shen, Wei & Zhang, H.M., 2009. "On the morning commute problem in a corridor network with multiple bottlenecks: Its system-optimal traffic flow patterns and the realizing tolling scheme," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 267-284, March.
    6. Carey, Malachy, 2021. "The cell transmission model with free-flow speeds varying over time or space," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 245-257.
    7. Zhang, Pinchao & Qian, Sean, 2020. "Path-based system optimal dynamic traffic assignment: A subgradient approach," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 41-63.
    8. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    9. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    10. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    11. Li, Xue-yan & Li, Xue-mei & Yang, Lingrun & Li, Jing, 2018. "Dynamic route and departure time choice model based on self-adaptive reference point and reinforcement learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 77-92.
    12. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    13. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    14. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    15. S. Waller & Athanasios Ziliaskopoulos, 2006. "A Combinatorial user optimal dynamic traffic assignment algorithm," Annals of Operations Research, Springer, vol. 144(1), pages 249-261, April.
    16. Wu, Chengyuan & Yang, Liangze & Du, Jie & Pei, Xin & Wong, S.C., 2024. "Continuum dynamic traffic models with novel local route-choice strategies for urban cities," Transportation Research Part B: Methodological, Elsevier, vol. 181(C).
    17. Islam, Tarikul & Vu, Hai L. & Hoang, Nam H. & Cricenti, Antonio, 2018. "A linear bus rapid transit with transit signal priority formulation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 163-184.
    18. Jin, Wen-Long, 2015. "On the existence of stationary states in general road networks," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 917-929.
    19. Satsukawa, Koki & Wada, Kentaro & Watling, David, 2022. "Dynamic system optimal traffic assignment with atomic users: Convergence and stability," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 188-209.
    20. Ma, Rui & Ban, Xuegang (Jeff) & Pang, Jong-Shi, 2014. "Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 98-122.

    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:157:y:2022:i:c:p:24-41. 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.