IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v213y2026ics1366554526003170.html

Safety-aware traffic assignment model in mixed CAV-HDV networks: a multi-player perspective

Author

Listed:
  • Tang, Huimin
  • Han, Chunyang
  • Liu, Yiping
  • Sun, Zhanbo
  • Chen, Tiantian
  • Chen, Anthony

Abstract

Fully controllable connected and automated vehicles (CAVs) have been extensively studied as potential tools for improving traffic efficiency, even coexisting with selfish human routing behaviors. However, their potential advantages when balancing efficiency and safety in route choice remain underexplored. Moreover, these advantages depend critically on operational objectives: selfish CAVs (privately owned or transportation network company (TNC)-operated pursuing individual or fleet cost minimization) may exacerbate system costs, while government-operated CAVs pursuing system optimum may improve system performance. To address these issues, this study develops a safety-aware mixed traffic assignment problem (SM-TAP) model. The model first extends the classic travel time cost by incorporating a route-based crash risk cost (CRC) considering both links and intersections, forming a generalized travel cost with non-monotonic properties in mixed traffic flow. The SM-TAP model is then constructed within a general variational inequality (VI) framework that models HDVs under stochastic user equilibrium (SUE) principles and CAVs according to their different operational objectives—individual travelers as user equilibrium (UE) players, TNCs as fleet optimization (FO) players, and traffic planners as system optimal (SO) players. The SM-TAP model and proposed path-based solution algorithm are evaluated through numerical experiments on the Nguyen-Dupuis, Sioux Falls networks and Changsha network, and benchmarked against a mixed traffic assignment model that considers only travel time. The results yield three main findings: (i) Regardless of CAV objectives, low CAV penetration rates (approximately 10%–20%) increase system costs when safety is considered, after which costs decline as CAV penetration increases; by contrast, when only travel time is considered, costs decrease monotonically with CAV penetration. (ii) When CAVs operate under the SO objective, system costs are consistently lower than under other perspectives, as routing choices can reduce HDV costs and ultimately improve overall efficiency, even at the expense of CAV costs. Conversely, “selfish fleets” (i.e., FO) behaviors impose a greater burden on the system than individually selfish routing (i.e., UE). (iii) Although the addition of CAVs on a given road segment may increase travel time due to congestion effects, rational system-level deployment of CAVs can consistently reduce safety costs, thereby lowering overall transportation system costs.

Suggested Citation

  • Tang, Huimin & Han, Chunyang & Liu, Yiping & Sun, Zhanbo & Chen, Tiantian & Chen, Anthony, 2026. "Safety-aware traffic assignment model in mixed CAV-HDV networks: a multi-player perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 213(C).
  • Handle: RePEc:eee:transe:v:213:y:2026:i:c:s1366554526003170
    DOI: 10.1016/j.tre.2026.104978
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2026.104978?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:transe:v:213:y:2026:i:c:s1366554526003170. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/600244/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.