Complementarity models for traffic equilibrium with ridesharing
Artículo
Publication date
2015Metadata
Show full item record
Cómo citar
Xu, Huayu
Cómo citar
Complementarity models for traffic equilibrium with ridesharing
Abstract
It is estimated that 76% of commuters are driving to work alone while each of them experiences a 38-h delay annually due to traffic congestion. Ridesharing is an efficient way to utilize the unused capacity and help with congestion reduction, and it has recently become more and more popular due to new communication technologies. Understanding the complex relations between ridesharing and traffic congestion is a critical step in the evaluation of a ridesharing enterprise or of the effectiveness of regulatory policies or incentives to promote ridesharing. The objective of this paper is to introduce a mathematical framework for the study of the ridesharing impacts on traffic congestion and to pave the way for the analysis of how people can be motivated to participate in ridesharing, and conversely, how congestion influences ridesharing activities. We accomplish this objective by developing a new traffic equilibrium model with ridesharing, and formulating the model as a mixed complementarity problem (MiCP). We provide conditions on the model parameters under which there exists one and only one solution to this model. The computational results show that when the congestion cost decreases or the ridesharing inconvenience cost increases, more travelers would become solo drivers and thus less people would participate in ridesharing. On the other hand, when the ridesharing price increases, more travelers would become ridesharing drivers.
General note
Artículo de publicación ISI
Patrocinador
U.S. National Science Foundation
CMMI-1402052
Identifier
URI: https://repositorio.uchile.cl/handle/2250/136292
DOI: DOI: 10.1016/j.trb.2015.08.013
Quote Item
Transportation Research Part B: Methodological Volume 81, Part 1, November 2015, Pages 161–182
Collections
The following license files are associated with this item: