An official website of the United States government
In this paper, we consider a multi-modal mobility system of travelers each with an individual travel budget, and propose a game-theoretic framework to assign each traveler to a “mobility service” (each one representing a different mode of transportation). We are interested in equity and sustainability, thus we maximize the worst-case revenue of the mobility system while ensuring “mobility equity,” which we define it in terms of accessibility. In the proposed framework, we ensure that all travelers are truthful and voluntarily participate under informational asymmetry, and the solution respects the individual budget of each traveler. Each traveler may seek to travel using multiple services (e.g., car, bus, train, bike). The services are capacitated and can serve up to a fixed number of travelers at any instant of time. Thus, our problem falls under the category of many-to-one assignment problems, where the goal is to find the conditions that guarantee the stability of assignments. We formulate a linear program of maximizing worst-case revenue under the constraints of mobility equity, and we fully characterize the optimal solution.
more »
« less
This content will become publicly available on April 25, 2026
Preserving equity: multi-objective connected and automated vehicle (CAV) lane deployment in mixed traffic
This paper investigates deploying connected and automated vehicle (CAV) lanes in transportation networks with a focus on measuring and preserving equity among travelers. A new metric is proposed to characterize equity based on (1) generalized travel cost per unit origin-destination (OD) distance for travelers on each OD pair and using each vehicle type and (2) maximum deviation of the standardized unit generalized travel cost from system average. A bi-level bi-objective program is developed to simultaneously minimize system travel cost and inequity while deploying CAV lanes. A solution algorithm that combines nondominated sorting genetic algorithm II and variable neighborhood search is designed. Through extensive numerical experiments, we find (1) inequity is more prominent when travel demand is high; (2) human-driven vehicle travelers become more disadvantageous with lower CAV price and higher CAV automation; and (3) subsidy is effective in mitigating inequity, but a fee for using CAV lanes is less promising.
more »
« less
- Award ID(s):
- 2112650
- PAR ID:
- 10592415
- Publisher / Repository:
- Taylor & Francis
- Date Published:
- Journal Name:
- Transportation Planning and Technology
- ISSN:
- 0308-1060
- Page Range / eLocation ID:
- 1 to 42
- Subject(s) / Keyword(s):
- Equity dedicated CAV lane deployment bi-level bi-objective program NSGA-IIVNS pareto frontier subsidy
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In the urban corridor with a mixed traffic composition of connected and automated vehicles (CAVs) alongside human-driven vehicles (HDVs), vehicle operations are intricately influenced by both individual driving behaviors and the presence of signalized intersections. Therefore, the development of a coordinated control strategy that effectively accommodates these dual factors becomes imperative to enhance the overall quality of traffic flow. This study proposes a bi-level structure crafted to decouple the joint effects of the vehicular driving behaviors and corridor signal offsets setting. The objective of this structure is to optimize both the average travel time (ATT) and fuel consumption (AFC). At the lower-level, three types of car-following models while considering driving modes are presented to illustrate the desired driving behaviors of HDVs and CAVs. Moreover, a trigonometry function method combined with a rolling horizon scheme is proposed to generate the eco-trajectory of CAVs in the mixed traffic flow. At the upper-level, a multi-objective optimization model for corridor signal offsets is formulated to minimize ATT and AFC based on the lower-level simulation outputs. Additionally, a revised Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is adopted to identify the set of Pareto-optimal solutions for corridor signal offsets under different CAV penetration rates (CAV PRs). Numerical experiments are conducted within a corridor that encompasses three signalized intersections. The performance of our proposed eco-driving strategy is validated in comparison to the intelligent driver model (IDM) and green light optimal speed advisory (GLOSA) algorithm in single-vehicle simulation. Results show that our proposed strategy yields reduced travel time and fuel consumption to both IDM and GLOSA. Subsequently, the effectiveness of our proposed coordinated control strategy is validated across various CAV PRs. Results indicated that the optimal AFC can be reduced by 4.1%–32.2% with CAV PRs varying from 0.2 to 1, and the optimal ATT can be saved by 2.3% maximum. Furthermore, sensitivity analysis is conducted to evaluate the impact of CAV PRs and V/C ratios on the optimal ATT and AFC.more » « less
-
Developing, Analyzing, and Evaluating Self-Drive Algorithms Using Electric Vehicles on a Test CourseReliable lane-following is one of the most important tasks for an automated vehicle or ADAS. The intent of this project was to design and evaluate multiple lane-following algorithms for an automated vehicle using computer vision. The implemented algorithms' performance was then evaluated on a testing course and compared with a human driver. ROS and OpenCV were used to detect and follow lanes on the road. A street-legal vehicle with a high-definition camera and drive-by-wire system was used to implement and evaluate driving data. Each algorithm was evaluated based on time for completion, speed limit infractions, and lane positioning infractions. The recorded evaluation data determined the most reliable lane-following algorithm. All of our algorithms had a success rate of at least 60% on certain lanes of the testing course.more » « less
-
The performance of connected and automated vehicle (CAV) platoons, aimed at improving traffic efficiency and safety, depends on vehicle dynamics and communication reliability. However, CAVs are vulnerable to perturbations in vehicular communication. Such endogenous vulnerability can induce oscillatory dynamics to CAVs, leading to the failure of platooning. Differing from previous work on CA V platoon stability, this research exploits CAV platooning vulnerability under periodic perturbation by formulating the oscillatory dynamics as vibrations in a mechanical system. Akin to other mechanical systems, a CAV platoon has its inherent oscillation frequency, exhibiting unique characteristics in a perturbed travel environment. To this end, this paper proposes an approach to characterize the CAV platooning vulnerability using the mechanical vibration theory. The employed theory reveals that CAV platooning vulnerability mainly associates with its resonance frequency, through which a small periodic perturbation can amplify the platoon oscillation. The analytical formulation and simulation results show that preventing periodic perturbations from a platoon's resonance frequency is crucial to enhance the CAV platooning reliability and suppress large amplitude oscillations, helping to secure the expected benefits of CAV platoons.more » « less
-
The trajectory-aware lowest-cost path selection problem aims to find the lowest-cost path using trajectory data. Trajectory data is valuable since it carries information about travel cost along paths, and also reflects travelers' routing preference. Path-centric travel cost estimation models using trajectory data grows popular recently, which considers the auto-correlation of the energy consumption on different segments of a path. However, path-centric models are more computationally expensive than edge-centric models. The main challenge of this problem is that the travel cost of every candidate path explored during the process of searching for the lowest-cost path need to be estimated, resulting in high computational cost. The current path selection algorithms that use path-centric cost estimation models still follow the pattern of "path + edge" when exploring candidate paths, which may result in redundant computation. We introduce a trajectory-aware graph model in which each node is a maximal trajectory-aware path. Two nodes in the trajectory-aware graph are linked by an edge if their union forms a trajectory-union path. We then propose a path selection algorithm to find a path in the proposed trajectory-aware graph which corresponds to the lowest-cost path in the input spatial network. We prove theoretically the proposed algorithm is correct and complete. Moreover, we prove theoretically that the proposed path selection algorithm cost much less computational time than the algorithm used in the related work, and validate it through experiments using real-world trajectory data.more » « less
