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

Path-constrained traffic assignment: Modeling and computing network impacts of stochastic range anxiety

Author

Listed:
  • Xie, Chi
  • Wang, Tong-Gen
  • Pu, Xiaoting
  • Karoonsoontawong, Ampol

Abstract

It is notoriously known that range anxiety is one of the major barriers that hinder a wide adoption of plug-in electric vehicles, especially battery electric vehicles. Recent studies suggested that if the caused driving range limit makes any impact on travel behaviors, it more likely occurs on the tour or trip chain level than the trip level. To properly assess its impacts on travel choices and traffic congestion, this research is devoted to studying a new network equilibrium problem that implies activity location and travel path choices on the trip chain level subject to stochastic driving ranges. Convex optimization and variational inequality models are respectively constructed for characterizing the equilibrium conditions under both discretely and continuously distributed driving ranges. For deriving the equilibrium flow solutions for these problem cases, we suggested different adaptations of a well-known path-based algorithm—the projected gradient method.

Suggested Citation

  • Xie, Chi & Wang, Tong-Gen & Pu, Xiaoting & Karoonsoontawong, Ampol, 2017. "Path-constrained traffic assignment: Modeling and computing network impacts of stochastic range anxiety," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 136-157.
    • Handle: RePEc:eee:transb:v:103:y:2017:i:c:p:136-157
    DOI: 10.1016/j.trb.2017.04.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516305720
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.04.018?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. Xiao Fu & William Lam, 2014. "A network equilibrium approach for modelling activity-travel pattern scheduling problems in multi-modal transit networks with uncertainty," Transportation, Springer, vol. 41(1), pages 37-55, January.
    2. Adler, Thomas & Ben-Akiva, Moshe, 1979. "A theoretical and empirical model of trip chaining behavior," Transportation Research Part B: Methodological, Elsevier, vol. 13(3), pages 243-257, September.
    3. Recker, W. W., 2001. "A bridge between travel demand modeling and activity-based travel analysis," Transportation Research Part B: Methodological, Elsevier, vol. 35(5), pages 481-506, June.
    4. He, Fang & Yin, Yafeng & Lawphongpanich, Siriphong, 2014. "Network equilibrium models with battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 306-319.
    5. William Lam & Hai-jun Huang, 2002. "A combined activity/travel choice model for congested road networks with queues," Transportation, Springer, vol. 29(1), pages 5-29, February.
    6. Kitamura, Ryuichi, 1984. "Incorporating trip chaining into analysis of destination choice," Transportation Research Part B: Methodological, Elsevier, vol. 18(1), pages 67-81, February.
    7. Lam, William H. K. & Yin, Yafeng, 2001. "An activity-based time-dependent traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 549-574, July.
    8. Franke, Thomas & Krems, Josef F., 2013. "What drives range preferences in electric vehicle users?," Transport Policy, Elsevier, vol. 30(C), pages 56-62.
    9. Recker, W. W., 1995. "The household activity pattern problem: General formulation and solution," Transportation Research Part B: Methodological, Elsevier, vol. 29(1), pages 61-77, 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. Lee, Chungmok & Han, Jinil, 2017. "Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 130-152.
    2. Li, Jiapei & Xie, Chi, 2024. "Identifying and minimizing critical driving range thresholds for electric vehicles in intercity networks," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    3. Bao, Zhaoyao & Li, Jiapei & Bai, Xuehan & Xie, Chi & Chen, Zhibin & Xu, Min & Shang, Wen-Long & Li, Hailong, 2023. "An optimal charging scheduling model and algorithm for electric buses," Applied Energy, Elsevier, vol. 332(C).
    4. Zhou, Bo & Chen, Guo & Song, Qiankun & Dong, Zhao Yang, 2020. "Robust chance-constrained programming approach for the planning of fast-charging stations in electrified transportation networks," Applied Energy, Elsevier, vol. 262(C).
    5. Rui Chen & Xinglu Liu & Lixin Miao & Peng Yang, 2020. "Electric Vehicle Tour Planning Considering Range Anxiety," Sustainability, MDPI, vol. 12(9), pages 1-17, May.
    6. Anders F. Jensen & Thomas K. Rasmussen & Carlo G. Prato, 2020. "A Route Choice Model for Capturing Driver Preferences When Driving Electric and Conventional Vehicles," Sustainability, MDPI, vol. 12(3), pages 1-18, February.
    7. 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.
    8. Xiang Zhang & David Rey & S. Travis Waller & Nathan Chen, 2019. "Range-Constrained Traffic Assignment with Multi-Modal Recharge for Electric Vehicles," Networks and Spatial Economics, Springer, vol. 19(2), pages 633-668, June.

    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. Liu, Peng & Liao, Feixiong & Tian, Qiong & Huang, Hai-Jun & Timmermans, Harry, 2020. "Day-to-day needs-based activity-travel dynamics and equilibria in multi-state supernetworks," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 208-227.
    2. Xiao Fu & William Lam, 2014. "A network equilibrium approach for modelling activity-travel pattern scheduling problems in multi-modal transit networks with uncertainty," Transportation, Springer, vol. 41(1), pages 37-55, January.
    3. Vo, Khoa D. & Lam, William H.K. & Chen, Anthony & Shao, Hu, 2020. "A household optimum utility approach for modeling joint activity-travel choices in congested road networks," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 93-125.
    4. Liu, Peng & Liao, Feixiong & Huang, Hai-Jun & Timmermans, Harry, 2015. "Dynamic activity-travel assignment in multi-state supernetworks," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 656-671.
    5. Xiao Fu & William H. K. Lam, 2018. "Modelling joint activity-travel pattern scheduling problem in multi-modal transit networks," Transportation, Springer, vol. 45(1), pages 23-49, January.
    6. Bowman, J. L. & Ben-Akiva, M. E., 2001. "Activity-based disaggregate travel demand model system with activity schedules," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(1), pages 1-28, January.
    7. Mahdieh Allahviranloo & Thomas Bonet & Jérémy Diez, 2021. "Introducing shared life experience metric in urban planning," Transportation, Springer, vol. 48(3), pages 1125-1148, June.
    8. Li, Zhi-Chun & Lam, William H.K. & Wong, S.C., 2017. "Step tolling in an activity-based bottleneck model," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 306-334.
    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. Chow, Joseph Y.J. & Recker, Will W., 2012. "Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 463-479.
    11. He, Fang & Yin, Yafeng & Lawphongpanich, Siriphong, 2014. "Network equilibrium models with battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 306-319.
    12. Maruyama, Takuya & Sumalee, Agachai, 2007. "Efficiency and equity comparison of cordon- and area-based road pricing schemes using a trip-chain equilibrium model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(7), pages 655-671, August.
    13. Zhang, Xiaoning & Yang, Hai & Huang, Hai-Jun & Zhang, H. Michael, 2005. "Integrated scheduling of daily work activities and morning-evening commutes with bottleneck congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(1), pages 41-60, January.
    14. Cantelmo, Guido & Viti, Francesco, 2019. "Incorporating activity duration and scheduling utility into equilibrium-based Dynamic Traffic Assignment," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 365-390.
    15. Kang, Jee Eun & Chow, Joseph Y.J. & Recker, Will W., 2013. "On activity-based network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 398-418.
    16. Li, Zhi-Chun & Lam, William H.K. & Wong, S.C., 2014. "Bottleneck model revisited: An activity-based perspective," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 262-287.
    17. Garling, Tommy & Kwan, Mei-Po & Golledge, Reginald G., 1991. "Computational-Process Modelling of Travel Decisions: Review and Conceptual Analysis," University of California Transportation Center, Working Papers qt6mk0h2s2, University of California Transportation Center.
    18. Allahviranloo, Mahdieh & Recker, Will, 2013. "Daily activity pattern recognition by using support vector machines with multiple classes," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 16-43.
    19. Bhat, Chandra R., 1997. "Work travel mode choice and number of non-work commute stops," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 41-54, February.
    20. Jee Eun Kang & Will Recker, 2015. "Strategic Hydrogen Refueling Station Locations with Scheduling and Routing Considerations of Individual Vehicles," Transportation Science, INFORMS, vol. 49(4), pages 767-783, November.

    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:103:y:2017:i:c:p:136-157. 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.