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

Eco-system optimal time-dependent flow assignment in a congested network

Author

Listed:
  • Lu, Chung-Cheng
  • Liu, Jiangtao
  • Qu, Yunchao
  • Peeta, Srinivas
  • Rouphail, Nagui M.
  • Zhou, Xuesong

Abstract

This research addresses the eco-system optimal dynamic traffic assignment (ESODTA) problem which aims to find system optimal eco-routing or green routing flows that minimize total vehicular emission in a congested network. We propose a generic agent-based ESODTA model and a simplified queueing model (SQM) that is able to clearly distinguish vehicles’ speed in free-flow and congested conditions for multi-scale emission analysis, and facilitates analyzing the relationship between link emission and delay. Based on the SQM, an expanded space-time network is constructed to formulate the ESODTA with constant bottleneck discharge capacities. The resulting integer linear model of the ESODTA is solved by a Lagrangian relaxation-based algorithm. For the simulation-based ESODTA, we present the column-generation-based heuristic, which requires link and path marginal emissions in the embedded time-dependent least-cost path algorithm and the gradient-projection-based descent direction method. We derive a formula of marginal emission which encompasses the marginal travel time as a special case, and develop an algorithm for evaluating path marginal emissions in a congested network. Numerical experiments are conducted to demonstrate that the proposed algorithm is able to effectively obtain coordinated route flows that minimize the system-wide vehicular emission for large-scale networks.

Suggested Citation

  • Lu, Chung-Cheng & Liu, Jiangtao & Qu, Yunchao & Peeta, Srinivas & Rouphail, Nagui M. & Zhou, Xuesong, 2016. "Eco-system optimal time-dependent flow assignment in a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 217-239.
    • Handle: RePEc:eee:transb:v:94:y:2016:i:c:p:217-239
    DOI: 10.1016/j.trb.2016.09.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516300996
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2016.09.015?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. Peeta, Srinivas & Zhou, Chao, 2006. "Stochastic quasi-gradient algorithm for the off-line stochastic dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 40(3), pages 179-206, March.
    2. Gaker, David & Zheng, Yanding & Walker, Joan, 2010. "Experimental Economics in Transportation: A Focus on Social Influences and the Provision of Information," University of California Transportation Center, Working Papers qt7vg9m3r1, University of California Transportation Center.
    3. Newell, G. F., 1993. "A simplified theory of kinematic waves in highway traffic, part III: Multi-destination flows," Transportation Research Part B: Methodological, Elsevier, vol. 27(4), pages 305-313, August.
    4. Lafortune, Stéphane & Sengupta, Raja & Kaufman, David E. & Smith, Robert L., 1993. "Dynamic system-optimal traffic assignment using a state space model," Transportation Research Part B: Methodological, Elsevier, vol. 27(6), pages 451-472, December.
    5. Shen, Wei & Zhang, H. Michael, 2009. "On the Morning Commute Problem in a Corridor Network with Multiple Bottlenecks: Its System-optimal Traffic Flow Patterns and the Realizing Tolling Scheme," Institute of Transportation Studies, Working Paper Series qt9bs815sq, Institute of Transportation Studies, UC Davis.
    6. Byung-Wook Wie & Roger L. Tobin & Terry L. Friesz, 1994. "The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time," Transportation Science, INFORMS, vol. 28(3), pages 204-220, August.
    7. Malachy Carey, 1987. "Optimal Time-Varying Flows on Congested Networks," Operations Research, INFORMS, vol. 35(1), pages 58-69, February.
    8. Doan, Kien & Ukkusuri, Satish V., 2012. "On the holding-back problem in the cell transmission based dynamic traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1218-1238.
    9. Newell, G. F., 1993. "A simplified theory of kinematic waves in highway traffic, part II: Queueing at freeway bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 27(4), pages 289-303, August.
    10. Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
    11. Carey, Malachy & Watling, David, 2012. "Dynamic traffic assignment approximating the kinematic wave model: System optimum, marginal costs, externalities and tolls," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 634-648.
    12. 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.
    13. Thomas L. Magnanti & Georgia Perakis, 1997. "Averaging Schemes for Variational Inequalities and Systems of Equations," Mathematics of Operations Research, INFORMS, vol. 22(3), pages 568-587, August.
    14. W. Y. Szeto & Xiaoqing Jaber & S. C. Wong, 2012. "Road Network Equilibrium Approaches to Environmental Sustainability," Transport Reviews, Taylor & Francis Journals, vol. 32(4), pages 491-518, April.
    15. Carey, Malachy & Subrahmanian, Eswaran, 2000. "An approach to modelling time-varying flows on congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 157-183, April.
    16. Muñoz, Juan Carlos & Laval, Jorge A., 2006. "System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination," Transportation Research Part B: Methodological, Elsevier, vol. 40(1), pages 1-15, January.
    17. Yin, Jiateng & Tang, Tao & Yang, Lixing & Gao, Ziyou & Ran, Bin, 2016. "Energy-efficient metro train rescheduling with uncertain time-variant passenger demands: An approximate dynamic programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 178-210.
    18. 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.
    19. 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.
    20. Carey, Malachy, 1992. "Nonconvexity of the dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 26(2), pages 127-133, April.
    21. Paul I. Richards, 1956. "Shock Waves on the Highway," Operations Research, INFORMS, vol. 4(1), pages 42-51, February.
    22. 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).
    23. Daganzo, Carlos F., 2006. "In traffic flow, cellular automata = kinematic waves," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 396-403, June.
    24. Leclercq, Ludovic, 2007. "Hybrid approaches to the solutions of the "Lighthill-Whitham-Richards" model," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 701-709, August.
    25. 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.
    26. 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.
    27. 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.
    28. Newell, G. F., 1993. "A simplified theory of kinematic waves in highway traffic, part I: General theory," Transportation Research Part B: Methodological, Elsevier, vol. 27(4), pages 281-287, August.
    29. Tong, Lu & Zhou, Xuesong & Miller, Harvey J., 2015. "Transportation network design for maximizing space–time accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 555-576.
    30. Newell, G. F., 2002. "A simplified car-following theory: a lower order model," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 195-205, March.
    31. Li, Pengfei & Mirchandani, Pitu & Zhou, Xuesong, 2015. "Solving simultaneous route guidance and traffic signal optimization problem using space-phase-time hypernetwork," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 103-130.
    32. Hong Zheng & Yi-Chang Chiu, 2011. "A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 45(1), pages 121-137, February.
    33. Garcia, Alfredo & Reaume, Daniel & Smith, Robert L., 2000. "Fictitious play for finding system optimal routings in dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 147-156, February.
    34. 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.
    35. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    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. Li, Wenjie & Yang, Lixing & Wang, Li & Zhou, Xuesong & Liu, Ronghui & Gao, Ziyou, 2017. "Eco-reliable path finding in time-variant and stochastic networks," Energy, Elsevier, vol. 121(C), pages 372-387.
    2. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    3. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
    4. Shang, Pan & Xiong, Yufan & Guo, Jifu & Xian, Kai & Yu, Yun & Xu, Han, 2024. "A modeling framework to integrate frequency - and schedule-based passenger assignment approaches for coordinated path choice and space-time trajectory estimation based on multi-source observations," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    5. Xing Chen & Leishan Zhou & Yixiang Yue & Yu Zhou & Liwen Liu, 2018. "Data-Driven Method to Estimate the Maximum Likelihood Space–Time Trajectory in an Urban Rail Transit System," Sustainability, MDPI, vol. 10(6), pages 1-21, May.
    6. Liu, Jiangtao & Zhou, Xuesong, 2019. "Observability quantification of public transportation systems with heterogeneous data sources: An information-space projection approach based on discretized space-time network flow models," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 302-323.
    7. Yin, Jiateng & Yang, Lixing & Tang, Tao & Gao, Ziyou & Ran, Bin, 2017. "Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 182-213.
    8. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Timmermans, Harry, 2019. "Tolerance-based strategies for extending the column generation algorithm to the bounded rational dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 102-121.
    9. 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.
    10. Wei, Yuguang & Avcı, Cafer & Liu, Jiangtao & Belezamo, Baloka & Aydın, Nizamettin & Li, Pengfei(Taylor) & Zhou, Xuesong, 2017. "Dynamic programming-based multi-vehicle longitudinal trajectory optimization with simplified car following models," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 102-129.
    11. 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.

    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. 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.
    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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Wang, Peirong (Slade) & Li, Pengfei (Taylor) & Chowdhury, Farzana R. & Zhang, Li & Zhou, Xuesong, 2020. "A mixed integer programming formulation and scalable solution algorithms for traffic control coordination across multiple intersections based on vehicle space-time trajectories," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 266-304.
    10. 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.
    11. Raadsen, Mark P.H. & Bliemer, Michiel C.J., 2019. "Continuous-time general link transmission model with simplified fanning, Part II: Event-based algorithm for networks," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 471-501.
    12. 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.
    13. Ngoduy, D. & Hoang, N.H. & Vu, H.L. & Watling, D., 2016. "Optimal queue placement in dynamic system optimum solutions for single origin-destination traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 148-169.
    14. Wang, Yi & Szeto, W.Y. & Han, Ke & Friesz, Terry L., 2018. "Dynamic traffic assignment: A review of the methodological advances for environmentally sustainable road transportation applications," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 370-394.
    15. 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.
    16. Mohebifard, Rasool & Hajbabaie, Ali, 2019. "Optimal network-level traffic signal control: A benders decomposition-based solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 252-274.
    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. B. G. Heydecker & J. D. Addison, 2005. "Analysis of Dynamic Traffic Equilibrium with Departure Time Choice," Transportation Science, INFORMS, vol. 39(1), pages 39-57, February.
    19. Zhou, Fang & Li, Xiaopeng & Ma, Jiaqi, 2017. "Parsimonious shooting heuristic for trajectory design of connected automated traffic part I: Theoretical analysis with generalized time geography," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 394-420.
    20. Wen-Long Jin, 2021. "A Link Queue Model of Network Traffic Flow," Transportation Science, INFORMS, vol. 55(2), pages 436-455, March.

    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:94:y:2016:i:c:p:217-239. 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.