Standard

Transportation network with externalities. / Kuang, Zhonghong; Mazalov, Vladimir V.; Tang, Xindi; Zheng, Jie.

In: Journal of Computational and Applied Mathematics, Vol. 382, 113091, 15.01.2021.

Research output: Contribution to journalArticlepeer-review

Harvard

Kuang, Z, Mazalov, VV, Tang, X & Zheng, J 2021, 'Transportation network with externalities', Journal of Computational and Applied Mathematics, vol. 382, 113091. https://doi.org/10.1016/j.cam.2020.113091

APA

Kuang, Z., Mazalov, V. V., Tang, X., & Zheng, J. (2021). Transportation network with externalities. Journal of Computational and Applied Mathematics, 382, [113091]. https://doi.org/10.1016/j.cam.2020.113091

Vancouver

Kuang Z, Mazalov VV, Tang X, Zheng J. Transportation network with externalities. Journal of Computational and Applied Mathematics. 2021 Jan 15;382. 113091. https://doi.org/10.1016/j.cam.2020.113091

Author

Kuang, Zhonghong ; Mazalov, Vladimir V. ; Tang, Xindi ; Zheng, Jie. / Transportation network with externalities. In: Journal of Computational and Applied Mathematics. 2021 ; Vol. 382.

BibTeX

@article{b0bf96230dd948529743e56a8214abcc,
title = "Transportation network with externalities",
abstract = "In a transportation network comprised of parallel routes with linear latency functions, we study how externalities among different routes affect the socially optimal allocation and the equilibrium allocation of traffic flows. Assuming that the externalities are not too severe, we analytically derive a system of equations that define the optimal distribution of the traffic flow with minimum social cost. We also solve for the Wardrop equilibrium without route charges in which every commuter minimizes the travel time. Furthermore, we characterize the Wardrop equilibrium with route charges in which two carriers set prices to maximize their own profits and commuters choose which carrier{\textquoteright}s service to use in order to minimize the sum of monetary cost (service price paid) and waiting cost (travel time spent). Our results show that Wardrop{\textquoteright}s first principle (user equilibrium) remains valid with mild externality level, and his second principle (social optimum), which usually fails to hold in equilibrium in a standard setup without externalities, can be achieved together with the first principle under some externality conditions, leading to the price of anarchy equal to 1. We also show that when the traffic flow goes to infinity, the price of anarchy can still be greater than 1 with the existence of externalities.",
keywords = "Externality, Traffic flow, Linear latency function, Wardrop equilibrium, Price of anarchy",
author = "Zhonghong Kuang and Mazalov, {Vladimir V.} and Xindi Tang and Jie Zheng",
year = "2021",
month = jan,
day = "15",
doi = "10.1016/j.cam.2020.113091",
language = "русский",
volume = "382",
journal = "Journal of Computational and Applied Mathematics",
issn = "0377-0427",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Transportation network with externalities

AU - Kuang, Zhonghong

AU - Mazalov, Vladimir V.

AU - Tang, Xindi

AU - Zheng, Jie

PY - 2021/1/15

Y1 - 2021/1/15

N2 - In a transportation network comprised of parallel routes with linear latency functions, we study how externalities among different routes affect the socially optimal allocation and the equilibrium allocation of traffic flows. Assuming that the externalities are not too severe, we analytically derive a system of equations that define the optimal distribution of the traffic flow with minimum social cost. We also solve for the Wardrop equilibrium without route charges in which every commuter minimizes the travel time. Furthermore, we characterize the Wardrop equilibrium with route charges in which two carriers set prices to maximize their own profits and commuters choose which carrier’s service to use in order to minimize the sum of monetary cost (service price paid) and waiting cost (travel time spent). Our results show that Wardrop’s first principle (user equilibrium) remains valid with mild externality level, and his second principle (social optimum), which usually fails to hold in equilibrium in a standard setup without externalities, can be achieved together with the first principle under some externality conditions, leading to the price of anarchy equal to 1. We also show that when the traffic flow goes to infinity, the price of anarchy can still be greater than 1 with the existence of externalities.

AB - In a transportation network comprised of parallel routes with linear latency functions, we study how externalities among different routes affect the socially optimal allocation and the equilibrium allocation of traffic flows. Assuming that the externalities are not too severe, we analytically derive a system of equations that define the optimal distribution of the traffic flow with minimum social cost. We also solve for the Wardrop equilibrium without route charges in which every commuter minimizes the travel time. Furthermore, we characterize the Wardrop equilibrium with route charges in which two carriers set prices to maximize their own profits and commuters choose which carrier’s service to use in order to minimize the sum of monetary cost (service price paid) and waiting cost (travel time spent). Our results show that Wardrop’s first principle (user equilibrium) remains valid with mild externality level, and his second principle (social optimum), which usually fails to hold in equilibrium in a standard setup without externalities, can be achieved together with the first principle under some externality conditions, leading to the price of anarchy equal to 1. We also show that when the traffic flow goes to infinity, the price of anarchy can still be greater than 1 with the existence of externalities.

KW - Externality

KW - Traffic flow

KW - Linear latency function

KW - Wardrop equilibrium

KW - Price of anarchy

U2 - 10.1016/j.cam.2020.113091

DO - 10.1016/j.cam.2020.113091

M3 - статья

VL - 382

JO - Journal of Computational and Applied Mathematics

JF - Journal of Computational and Applied Mathematics

SN - 0377-0427

M1 - 113091

ER -

ID: 132198358