A modern congestion pricing policy for urban traffic: subsidy plus toll
Bibliographic record
Abstract
Congestion pricing is seen as an effective policy to address traffic congestion. In such policies where money, people and authorities are involved, the success generally hinges upon two factors: equity (being fair) and acceptability (to both people and authorities). The primary concern is the equity, for which “tradable credit scheme (TCS)” has been introduced and extensively studied in the literature. Nevertheless, due to the complexity of the trading schemes, the TCS has yet to find any foot in the real world. To this end, a novel idea of rewarding has substituted the trading component to be known as toll-and-subsidy scheme (TSS). The idea is to charge the drivers on some roads (toll) while rewarding them to use other alternative—and perhaps underutilized—roads (subsidy). The research of the TSS is in its infancy stage. The problem to be tackled in this study is as follows: Given a set of roads constituting a cordon line around the central business district (CBD) or across a screen line, how much toll or subsidy should be assigned to each road? The problem is first transformed into a capacitated traffic assignment problem. We employ a solution method based on augmenting the travel time of roads up to the level at which the traffic volumes do not exceed some target rates. A real dataset from the city of Winnipeg, Canada, is used as a pilot study. We then discuss policy-related applications of the TSS. It is proved in the literature that one can obtain optimal TSSs for various objectives and considerations. To this end, the non-negativity of the toll values is relaxed which results in a valid toll set. Nevertheless, the computational time is found to be of highest significance. Our method differs in the fact that the traffic volumes are bounded from the above and it is quite affordable. The main contribution is first to highlight the concept of subsidy along with traditional thought of merely toll. Second is to interpret the Lagrangian values of the capacity constraints as the values of the toll/subsidy.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".