On an Interlocking Flexible Car Use Restriction Policy: Theory, Learning and Experiment

Car use restrictions, such as the commonly implemented license plate restriction policy (PRP), are regarded as effective strategies for alleviating traffic congestion in many cities worldwide. Although these regulations help reduce daily vehicle volumes and evenly distribute them, they also limit commuters’ freedom to choose when to drive. A recent flexible car use restriction policy (FRP) allows commuters to select specific days to refrain from using their cars within a restriction cycle, enhancing travelers’ flexibility in urgent situations. Although the original FRP (O-FRP) may incur slightly higher average driving costs compared with the PRP due to uneven car use distribution, it can ultimately lower overall travel costs by accommodating more car uses during emergencies. This study introduces an interlocking FRP (IL-FRP), which groups travelers and assigns them different restriction cycles starting from distinct weekdays. Theoretical analysis reveals that, even under relaxed nonlinear travel cost assumptions, the user equilibrium solution of the IL-FRP, under ideal conditions, converges with the system optimal solution and further reaches the FRP’s theoretical lower bound while minimizing both driving and transit costs. Additionally, we develop two IL-FRP variants that are applicable regardless of the urgency probability distribution: the equally grouped FRP (ILE-FRP) and the arbitrarily grouped FRP (Arb-FRP). To derive equilibrium solutions for all FRPs under different parameter settings, we present a three-step learning algorithm using the mean field game framework. Numerical experiments validate the effectiveness of this algorithm and demonstrate that IL-FRP, ILE-FRP, and Arb-FRP offer advantages over O-FRP in terms of total travel cost. A series of laboratory experiments was conducted to support our theoretical findings. The results indicate some bounded rationality among individuals but align consistently with our theoretical predictions and learning outcomes. Funding: This work was supported by the National Natural Science Foundation of China [Grants 52302406 and 72201065] and the Natural Science Foundation of Fujian Province [Grants 2023J05022 and 2023J05099]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0837 .

Authors

Institutions

Publication Details

Journal
Transportation Science
Published
2025-07-24
DOI
https://doi.org/10.1287/trsc.2024.0837
Citations
1
Primary Topic
Transportation Planning and Optimization
Type
article
Field-Weighted Citation Impact
2.18
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On an Interlocking Flexible Car Use Restriction Policy: Theory, Learning and Experiment

Dianchao Lin, Li Li, Xiaoting Jiang
1 citations
Transportation Science
Transportation Planning and Optimization
2.18
article

On an Interlocking Flexible Car Use Restriction Policy: Theory, Learning and Experiment

Dianchao Lin, Li Li, Xiaoting Jiang
article en
1 citations

Abstract

Car use restrictions, such as the commonly implemented license plate restriction policy (PRP), are regarded as effective strategies for alleviating traffic congestion in many cities worldwide. Although these regulations help reduce daily vehicle volumes and evenly distribute them, they also limit commuters’ freedom to choose when to drive. A recent flexible car use restriction policy (FRP) allows commuters to select specific days to refrain from using their cars within a restriction cycle, enhancing travelers’ flexibility in urgent situations. Although the original FRP (O-FRP) may incur slightly higher average driving costs compared with the PRP due to uneven car use distribution, it can ultimately lower overall travel costs by accommodating more car uses during emergencies. This study introduces an interlocking FRP (IL-FRP), which groups travelers and assigns them different restriction cycles starting from distinct weekdays. Theoretical analysis reveals that, even under relaxed nonlinear travel cost assumptions, the user equilibrium solution of the IL-FRP, under ideal conditions, converges with the system optimal solution and further reaches the FRP’s theoretical lower bound while minimizing both driving and transit costs. Additionally, we develop two IL-FRP variants that are applicable regardless of the urgency probability distribution: the equally grouped FRP (ILE-FRP) and the arbitrarily grouped FRP (Arb-FRP). To derive equilibrium solutions for all FRPs under different parameter settings, we present a three-step learning algorithm using the mean field game framework. Numerical experiments validate the effectiveness of this algorithm and demonstrate that IL-FRP, ILE-FRP, and Arb-FRP offer advantages over O-FRP in terms of total travel cost. A series of laboratory experiments was conducted to support our theoretical findings. The results indicate some bounded rationality among individuals but align consistently with our theoretical predictions and learning outcomes. Funding: This work was supported by the National Natural Science Foundation of China [Grants 52302406 and 72201065] and the Natural Science Foundation of Fujian Province [Grants 2023J05022 and 2023J05099]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0837 .

Transportation ScienceVol. 59(5)
Fuzhou University (CN)
Openalex Percentile: Top 12%
Transportation Planning and Optimization
2.18
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.