[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v104y2017icp272-289.html
   My bibliography  Save this article

Efficient and fair system states in dynamic transportation networks

Author

Listed:
  • Zhu, Feng
  • Ukkusuri, Satish V.
Abstract
This paper sets out to model an efficient and fair transportation system accounting for both departure time choice and route choice of a general multi-OD network within a dynamic traffic assignment environment. Firstly, a bi-level optimization formulation is introduced based on the link-based traffic flow model. The upper level of the formulation minimizes the total system travel time, whereas the lower level captures traffic flow propagation and the user equilibrium constraints. Then the bi-level formulation is relaxed to a linear programming formulation that produces a lower bound of an efficient and fair system state. An efficient iterative algorithm is proposed to obtain the exact solution. It only requires solving one linear program in one iteration. Further, it is shown that the number of iterations is bounded, and the output traffic flow pattern is efficient and fair. Finally, two numerical cases (including a single OD network and a multi-OD network) are conducted to demonstrate the performance of the algorithm. The results consistently show that the departure rate pattern generated from the algorithm leads to an efficient and fair system state, and the algorithm converges within two iterations across all test scenarios.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:104:y:2017:i:c:p:272-289
    DOI: 10.1016/j.trb.2017.07.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516302120
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.07.010?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. Malachy Carey, 1987. "Optimal Time-Varying Flows on Congested Networks," Operations Research, INFORMS, vol. 35(1), pages 58-69, February.
    2. Guo, Xiaolei & Yang, Hai, 2010. "Pareto-improving congestion pricing and revenue refunding with multiple user classes," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 972-982, September.
    3. Han, Deren & Lo, Hong K. & Sun, Jie & Yang, Hai, 2008. "The toll effect on price of anarchy when costs are nonlinear and asymmetric," European Journal of Operational Research, Elsevier, vol. 186(1), pages 300-316, April.
    4. Wie, Byung-Wook & Friesz, Terry L. & Tobin, Roger L., 1990. "Dynamic user optimal traffic assignment on congested multidestination networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 431-442, December.
    5. Athanasios K. Ziliaskopoulos, 2000. "A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 34(1), pages 37-49, February.
    6. Malachy Carey & Ashok Srinivasan, 1993. "Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows," Operations Research, INFORMS, vol. 41(1), pages 217-231, February.
    7. 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).
    8. Xuegang Ban & Henry Liu, 2009. "A Link-Node Discrete-Time Dynamic Second Best Toll Pricing Model with a Relaxation Solution Algorithm," Networks and Spatial Economics, Springer, vol. 9(2), pages 243-267, June.
    9. Chow, Andy H.F., 2009. "Properties of system optimal traffic assignment with departure time choice and its solution method," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 325-344, March.
    10. Han, Ke & Friesz, Terry L. & Szeto, W.Y. & Liu, Hongcheng, 2015. "Elastic demand dynamic network user equilibrium: Formulation, existence and computation," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 183-209.
    11. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    12. Correa, Jose R. & Schulz, Andreas S. & Stier Moses, Nicolas E., 2004. "Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem," Working papers 4447-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    13. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2007. "Fast, Fair, and Efficient Flows in Networks," Operations Research, INFORMS, vol. 55(2), pages 215-225, April.
    14. Shen, Wei & Zhang, H.M., 2014. "System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 1-17.
    15. Satish Ukkusuri & S. Waller, 2008. "Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions," Networks and Spatial Economics, Springer, vol. 8(4), pages 383-406, December.
    16. Terry L. Friesz & Javier Luque & Roger L. Tobin & Byung-Wook Wie, 1989. "Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem," Operations Research, INFORMS, vol. 37(6), pages 893-901, December.
    17. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    18. 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.
    19. 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).
    20. Han, Lanshan & Ukkusuri, Satish & Doan, Kien, 2011. "Complementarity formulations for the cell transmission model based dynamic user equilibrium with departure time choice, elastic demand and user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1749-1767.
    21. 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.
    22. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    23. 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.
    24. 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.
    25. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    26. Han, Ke & Szeto, W.Y. & Friesz, Terry L., 2015. "Formulation, existence, and computation of boundedly rational dynamic user equilibrium with fixed or endogenous user tolerance," Transportation Research Part B: Methodological, Elsevier, vol. 79(C), pages 16-49.
    27. Jin, Wen-Long, 2015. "Continuous formulations and analytical properties of the link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 88-103.
    28. Ukkusuri, Satish V. & Han, Lanshan & Doan, Kien, 2012. "Dynamic user equilibrium with a path based cell transmission model for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1657-1684.
    29. Herbert A. Simon, 1991. "Bounded Rationality and Organizational Learning," Organization Science, INFORMS, vol. 2(1), pages 125-134, February.
    30. Wie, Byung-Wook & Tobin, Roger L. & Carey, Malachy, 2002. "The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 897-918, December.
    31. Di, Xuan & Liu, Henry X. & Pang, Jong-Shi & Ban, Xuegang (Jeff), 2013. "Boundedly rational user equilibria (BRUE): Mathematical formulation and solution sets," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 300-313.
    32. Ghali, M. O. & Smith, M. J., 1995. "A model for the dynamic system optimum traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 155-170, June.
    33. Gentile, Guido, 2016. "Solving a Dynamic User Equilibrium model based on splitting rates with Gradient Projection algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 120-147.
    34. 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.
    35. James K. Ho, 1980. "A Successive Linear Optimization Approach to the Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 14(4), pages 295-305, November.
    36. Szeto, W. Y. & Lo, Hong K., 2004. "A cell-based simultaneous route and departure time choice model with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 593-612, August.
    37. 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.
    38. Ban, Xuegang (Jeff) & Liu, Henry X. & Ferris, Michael C. & Ran, Bin, 2008. "A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations," Transportation Research Part B: Methodological, Elsevier, vol. 42(9), pages 823-842, November.
    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. Karaenke, Paul & Bichler, Martin & Merting, Soeren & Minner, Stefan, 2020. "Non-monetary coordination mechanisms for time slot allocation in warehouse delivery," European Journal of Operational Research, Elsevier, vol. 286(3), pages 897-907.
    2. 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.

    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. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun & Gao, Ziyou, 2015. "An intersection-movement-based stochastic dynamic user optimal route choice model for assessing network performance," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 182-217.
    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. Long, Jiancheng & Szeto, W.Y. & Gao, Ziyou & Huang, Hai-Jun & Shi, Qin, 2016. "The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 179-206.
    5. Long, Jiancheng & Szeto, W.Y. & Du, Jie & Wong, R.C.P., 2017. "A dynamic taxi traffic assignment model: A two-level continuum transportation system approach," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 222-254.
    6. 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).
    7. Jiancheng Long & Wai Yuen Szeto, 2019. "Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks," Operations Research, INFORMS, vol. 67(1), pages 167-182, January.
    8. Ukkusuri, Satish V. & Han, Lanshan & Doan, Kien, 2012. "Dynamic user equilibrium with a path based cell transmission model for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1657-1684.
    9. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    10. Friesz, Terry L. & Kim, Taeil & Kwon, Changhyun & Rigdon, Matthew A., 2011. "Approximate network loading and dual-time-scale dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 176-207, January.
    11. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    12. 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.
    13. 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.
    14. Ke Han & Gabriel Eve & Terry L. Friesz, 2019. "Computing Dynamic User Equilibria on Large-Scale Networks with Software Implementation," Networks and Spatial Economics, Springer, vol. 19(3), pages 869-902, September.
    15. Zhao, Chuan-Lin & Leclercq, Ludovic, 2018. "Graphical solution for system optimum dynamic traffic assignment with day-based incentive routing strategies," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 87-100.
    16. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    17. 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.
    18. Ma, Rui & Ban, Xuegang (Jeff) & Szeto, W.Y., 2017. "Emission modeling and pricing on single-destination dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 255-283.
    19. 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.
    20. 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.

    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:104:y:2017:i:c:p:272-289. 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.