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

Minimising emissions in traffic assignment with non-monotonic arc costs

Author

Listed:
  • Tidswell, J.
  • Downward, A.
  • Thielen, C.
  • Raith, A.

Abstract

The modelling of vehicle emissions within Traffic Assignment (TA) has been studied in the literature as emissions such as carbon monoxide and carbon dioxide are detrimental to the populace’s health as well as to the environment. TA is employed as a means to identify the potential to reduce vehicle emissions by obtaining emissions-minimising traffic patterns. TA captures the flow-dependent cost to traverse an arc in a so-called arc cost function, which often captures travel time, travel cost, or emissions. Arc cost functions that model emissions are naturally non-monotonic (partly increasing and partly decreasing) with respect to arc flow. Studies that make use of emission-based arc cost functions in TA generally assume a positive, increasing function, or do not discuss the computational complexities that arise when the arc cost functions are non-monotonic. In this paper, we investigate the implications of non-monotonic arc costs within the TA methodology and address the complexity of the resulting problem. We suggest adjustments to solution algorithms to heuristically allow the computation of TA solutions with non-monotonic arc costs. We present several methods to find good solutions to the TA problem with non-monotonic arc costs in the absence of a unique emissions-minimising solution. We compare these methods by applying them to several test networks for non-monotonic arc cost functions that model different emission types.

Suggested Citation

  • Tidswell, J. & Downward, A. & Thielen, C. & Raith, A., 2021. "Minimising emissions in traffic assignment with non-monotonic arc costs," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 70-90.
  • Handle: RePEc:eee:transb:v:153:y:2021:i:c:p:70-90
    DOI: 10.1016/j.trb.2021.08.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261521001594
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2021.08.007?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. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    2. Arnott, R. & de Palma, A. & Lindsey, R., 1990. "Departure time and route choice for the morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 209-228, June.
    3. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    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. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    6. 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.
    7. 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.
    8. Yuan-yuan Song & En-jian Yao & Ting Zuo & Zhi-feng Lang, 2013. "Emissions and Fuel Consumption Modeling for Evaluating Environmental Effectiveness of ITS Strategies," Discrete Dynamics in Nature and Society, Hindawi, vol. 2013, pages 1-9, February.
    9. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    10. Yang, Hai & Wang, Xiaolei & Yin, Yafeng, 2012. "The impact of speed limits on traffic equilibrium and system performance in networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1295-1307.
    11. 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.
    12. Chen, Linxi & Yang, Hai, 2012. "Managing congestion and emissions in road networks with tolls and rebates," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 933-948.
    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. Ding, Hongxing & Yang, Hai & Xu, Hongli & Li, Ting, 2023. "Status quo-dependent user equilibrium model with adaptive value of time," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 77-90.

    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. 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.
    2. 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.
    3. Michael W. Levin & Melissa Duell & S. Travis Waller, 2020. "Arrival Time Reliability in Strategic User Equilibrium," Networks and Spatial Economics, Springer, vol. 20(3), pages 803-831, September.
    4. 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.
    5. Vosough, Shaghayegh & de Palma, André & Lindsey, Robin, 2022. "Pricing vehicle emissions and congestion externalities using a dynamic traffic network simulator," Transportation Research Part A: Policy and Practice, Elsevier, vol. 161(C), pages 1-24.
    6. Watling, David, 2006. "User equilibrium traffic network assignment with stochastic travel times and late arrival penalty," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1539-1556, December.
    7. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    8. 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).
    9. Duong Viet Thong & Aviv Gibali & Mathias Staudigl & Phan Tu Vuong, 2021. "Computing Dynamic User Equilibrium on Large-Scale Networks Without Knowing Global Parameters," Networks and Spatial Economics, Springer, vol. 21(3), pages 735-768, September.
    10. Abdelfettah Laouzai & Rachid Ouafi, 2022. "A prediction model for atmospheric pollution reduction from urban traffic," Environment and Planning B, , vol. 49(2), pages 566-584, February.
    11. Loukas Dimitriou & Theodore Tsekeris, 2009. "Evolutionary game-theoretic model for dynamic congestion pricing in multi-class traffic networks," Netnomics, Springer, vol. 10(1), pages 103-121, April.
    12. Yu Nie, 2015. "A New Tradable Credit Scheme for the Morning Commute Problem," Networks and Spatial Economics, Springer, vol. 15(3), pages 719-741, September.
    13. Li, Qiaoru & Zhang, Zhe & Li, Kun & Chen, Liang & Wei, Zhenlin & Zhang, Jingchun, 2020. "Evolutionary dynamics of traveling behavior in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    14. Lim, Yongtaek & Heydecker, Benjamin, 2005. "Dynamic departure time and stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 39(2), pages 97-118, February.
    15. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    16. Daniel, Joseph I, 1995. "Congestion Pricing and Capacity of Large Hub Airports: A Bottleneck Model with Stochastic Queues," Econometrica, Econometric Society, vol. 63(2), pages 327-370, March.
    17. Yao, Tao & Friesz, Terry L. & Wei, Mike Mingcheng & Yin, Yafeng, 2010. "Congestion derivatives for a traffic bottleneck," Transportation Research Part B: Methodological, Elsevier, vol. 44(10), pages 1149-1165, December.
    18. Feng Xiao & Zhen Qian & H. Zhang, 2011. "The Morning Commute Problem with Coarse Toll and Nonidentical Commuters," Networks and Spatial Economics, Springer, vol. 11(2), pages 343-369, June.
    19. L. Denant-Boèmont & R. Petiot, 2003. "Information value and sequential decision-making in a transport setting: an experimental study," Post-Print hal-02422690, HAL.
    20. Liu, Louie Nan & McDonald, John F., 1999. "Economic efficiency of second-best congestion pricing schemes in urban highway systems," Transportation Research Part B: Methodological, Elsevier, vol. 33(3), pages 157-188, April.

    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:153:y:2021:i:c:p:70-90. 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.