Discrete Event Simulation of Driver's Routing Behavior Rule at a Road Intersection

Ben Benzaman; Erfan Pakdamanian

arxiv: 1907.00450 · v2 · pith:VV3Z5P7Vnew · submitted 2019-06-30 · 📡 eess.SY · cs.SY

Discrete Event Simulation of Driver's Routing Behavior Rule at a Road Intersection

Ben Benzaman , Erfan Pakdamanian This is my paper

Pith reviewed 2026-05-25 12:17 UTC · model grok-4.3

classification 📡 eess.SY cs.SY

keywords discrete event simulationdriver routing behaviortraffic intersectionshortest time routingroute selectiontraffic congestionsimulation modelingtraffic light phasing

0 comments

The pith

Shortest time routing at an intersection cuts wait time by 69.5 percent and total time by 65.72 percent versus shortest distance routing.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper uses discrete event simulation to model how drivers choose routes at a single road intersection. It tests three rules—shortest distance, shortest time, and less crowded road—across 864 scenarios that vary vehicle arrival rates, boundary behaviors, and traffic light phasing. The central finding is that shortest time routing produces the lowest overall wait and travel times under these conditions. A reader would care because the result points to a behavioral rule that could ease congestion without new roads or signals. The simulation treats the three rules as collective driver behaviors that interact with the listed factors.

Core claim

Among the three distinguishable routing decisions tested, shortest time routing offers the best performance across all interactions of the modeled factors. This routing behavior reduces traffic wait time by 69.5 percent and total time by 65.72 percent compared with shortest distance routing.

What carries the argument

Discrete event simulation that applies one of three driver routing rules (shortest distance, shortest time, or less crowded road) at each intersection traversal while varying arrival rate, boundary behavior, and light phasing.

If this is right

Shortest time routing outperforms both shortest distance and less crowded road routing under the full range of tested arrival rates and light timings.
Collective adoption of shortest time routing lowers aggregate intersection delay without changes to infrastructure.
The performance gap between rules widens or narrows depending on the specific combination of arrival rate, boundary behavior, and phasing.
The simulation framework can rank routing rules by total time and wait time for any given set of the three factors.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Encouraging drivers to estimate and follow shortest time routes could produce measurable congestion relief at similar single intersections.
Extending the same simulation structure to a network of connected intersections would test whether the 65-70 percent gains persist or diminish.
If real drivers deviate from the modeled rules in predictable ways, the simulation could be recalibrated by adjusting the probability of each rule.

Load-bearing premise

The three routing rules together with the chosen factors of arrival rate, boundary behavior, and light phasing are enough to capture the main influences on travel times at the modeled intersection.

What would settle it

Direct measurement of actual driver routes and travel times at a comparable real intersection that shows shortest time routing does not produce wait-time reductions near 69.5 percent would falsify the central claim.

read the original abstract

Several factors influence traffic congestion and overall traffic dynamics. Simulation modeling has been utilized to understand the traffic performance parameters during traffic congestions. This paper focuses on driver behavior of route selection by differentiating three distinguishable decisions, which are shortest distance routing, shortest time routing and less crowded road routing. This research generated 864 different scenarios to capture various traffic dynamics under collective driving behavior of route selection. Factors such as vehicle arrival rate, behaviors at system boundary and traffic light phasing were considered. The simulation results revealed that shortest time routing scenario offered the best solution considering all forms of interactions among the factors. Overall, this routing behavior reduces traffic wait time and total time (by 69.5% and 65.72%) compared to shortest distance routing.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The 864-scenario simulation finds shortest-time routing cuts delays versus shortest-distance, but the exact 69.5% and 65.72% figures come with no replication counts or variability measures, so they cannot be trusted as stable results.

read the letter

The paper runs a standard discrete-event simulation of three routing rules at one intersection. It varies arrival rate, boundary behavior, and signal phasing across 864 scenarios and reports that shortest-time routing produces the lowest wait and total times, with those specific percentage drops relative to shortest-distance routing. The less-crowded rule sits in between. That systematic sweep of factor combinations is the main piece of work here and is more thorough than many quick simulation studies on the topic. The setup itself follows routine traffic-simulation practice and does not introduce new methods or data sources. The central numbers are presented as direct outputs with no mention of how many independent runs were averaged per scenario, no random-seed handling, and no dispersion statistics. In a model driven by stochastic arrivals and phasing, single-point estimates like these are vulnerable to particular realizations rather than reflecting reliable differences between rules. The abstract also gives no validation against observed traffic or sensitivity checks on the model parameters. The assumption that the three rules plus the listed factors capture the dominant real-world effects is plausible for an exploratory study but remains untested here. This is the sort of paper that might interest someone already running similar intersection simulations who wants another data point on routing heuristics. It does not supply enough grounding for the quantitative claims to be used or cited directly. I would not bring it to a reading group and would not send it to peer review without the replication and variability details added.

Referee Report

3 major / 0 minor

Summary. The manuscript describes a discrete-event simulation of driver routing decisions at a road intersection, comparing three rules (shortest distance, shortest time, less crowded road) across 864 scenarios that vary vehicle arrival rate, boundary behaviors, and traffic-light phasing. The central claim is that shortest-time routing is superior and yields 69.5 % and 65.72 % reductions in wait time and total time, respectively, relative to shortest-distance routing.

Significance. If the reported reductions can be shown to be statistically stable and the model can be validated, the work would supply quantitative evidence that time-based routing can materially reduce intersection delay under a range of arrival and signal conditions. The scale of the scenario sweep (864 runs) is a constructive feature, but the current lack of model equations, replication statistics, and empirical grounding prevents the result from being usable for traffic-engineering decisions.

major comments (3)

[Results / Abstract] The headline percentages (69.5 % wait-time reduction, 65.72 % total-time reduction) are presented as exact point estimates in the abstract and results without any statement of the number of independent replications per scenario, random-seed handling, or dispersion statistics. In a stochastic discrete-event model driven by Poisson arrivals and phased signals, such omissions make it impossible to judge whether the quoted differences are robust or artifacts of single realizations.
[Methods / Model Description] No model equations, event-list definitions, or pseudocode are supplied for the three routing rules, the boundary behaviors, or the traffic-light phasing logic. Without these, the implementation of “shortest time” versus “shortest distance” cannot be verified and the claimed interactions among factors cannot be reproduced.
[Validation / Discussion] The simulation outputs are never compared with field data from an instrumented intersection; consequently the 864 scenarios remain unanchored and the quantitative superiority claim lacks external validity.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments. We address each major point below and indicate the changes planned for the revised manuscript.

read point-by-point responses

Referee: [Results / Abstract] The headline percentages (69.5 % wait-time reduction, 65.72 % total-time reduction) are presented as exact point estimates in the abstract and results without any statement of the number of independent replications per scenario, random-seed handling, or dispersion statistics. In a stochastic discrete-event model driven by Poisson arrivals and phased signals, such omissions make it impossible to judge whether the quoted differences are robust or artifacts of single realizations.

Authors: We agree that replication details and dispersion statistics are necessary to assess robustness in a stochastic simulation. Each of the 864 scenarios was executed once using fixed random seeds for reproducibility. We will revise the abstract, methods, and results sections to state the number of replications per scenario, describe random-seed handling, and report any available variability measures. Additional multiple replications across all scenarios would require substantial extra computation, but the single-run design with consistent seeding will be clarified. revision: yes
Referee: [Methods / Model Description] No model equations, event-list definitions, or pseudocode are supplied for the three routing rules, the boundary behaviors, or the traffic-light phasing logic. Without these, the implementation of “shortest time” versus “shortest distance” cannot be verified and the claimed interactions among factors cannot be reproduced.

Authors: We accept that the original manuscript omitted explicit algorithmic details. The revision will include the mathematical formulations for the three routing rules, the event-list structure, and pseudocode for routing decisions, boundary handling, and traffic-light phasing to support verification and reproduction of the factor interactions. revision: yes
Referee: [Validation / Discussion] The simulation outputs are never compared with field data from an instrumented intersection; consequently the 864 scenarios remain unanchored and the quantitative superiority claim lacks external validity.

Authors: The work is a controlled comparative simulation study examining relative performance across 864 scenarios. We do not have access to field data from instrumented intersections. In the revision we will expand the discussion to state this limitation explicitly, qualify the external-validity scope of the results, and outline possible future empirical validation steps. revision: partial

Circularity Check

0 steps flagged

No circularity: results are direct simulation outputs

full rationale

The paper reports outcomes from discrete-event simulations run across 864 scenarios that vary arrival rates, boundary behaviors, and signal phasing. The headline percentages (69.5% and 65.72% reductions) are stated as direct simulation outputs comparing the three routing rules; no equations, fitted parameters, self-citations, or ansatzes are invoked to derive these quantities. The work contains no derivation chain that could reduce to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the three routing rules and the listed factors are treated as given inputs.

pith-pipeline@v0.9.0 · 5652 in / 1050 out tokens · 26575 ms · 2026-05-25T12:17:21.380656+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

simulation models contain fundamental components such as roads, intersections, a sub-model for traffic light phasing, decision criteria at the intersection
IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

shortest time routing scenario offered the best solution... reduces traffic wait time and total time (by 69.5% and 65.72%)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

A Dynamic Sustainable Competitive Petroleum Supply Chain Model for Various Stakeholders with Shared Facilities
math.OC 2019-07 unverdicted novelty 3.0

A multi-period multi-objective MILP model is proposed and solved on real data for a dynamic sustainable competitive petroleum supply chain with shared facilities and stakeholder considerations.