CoSyDelay: Cognitive Symbolic Regression for Traffic Delay Estimation
Organizations: The Hong Kong Polytechnic University, Hong Kong, China
Abstract
Trustworthy estimation of traffic delays at signalized intersections is critical for modern transportation systems, as it supports proactive traffic control for congestion mitigation. Existing analytical methods often rely on idealized assumptions that limit their accuracy under complex traffic conditions, whereas data-driven methods may achieve strong estimation performance but usually lack transparent structures, which reduces confidence in their practical application. To address these limitations, we propose CoSyDelay, a cognitive symbolic regression (SR) framework for automatically deriving explicit and physically consistent empirical delay estimation expressions (DEEs). Specifically, CoSyDelay decomposes intersection-level delay estimation into turning-movement-level subproblems, thereby reducing the complexity of the symbolic search. During DEE learning, CoSyDelay constructs domain-informed symbolic inputs from traffic variables. Large language models (LLMs) are employed as symbolic search operators to iteratively generate and refine candidate expression structures, whose movement-specific coefficients are subsequently calibrated using approach-level delay labels. A composite fitness function evaluates the learned DEEs jointly in terms of estimation accuracy and compliance with specified traffic-delay principles. Experimental results on multiple signalized intersections demonstrate that the resulting expressions achieve competitive estimation performance while maintaining physical consistency, thereby supporting trustworthy delay estimation. Source code and datasets are available at https://github.com/ForrestXie9/CoSyDelay.
Figures & tables
| Approach | Model form | Modeling method | Structure discovery | Model evaluation | Model output |
| Analytical delay models [ 7 , 3 , 8 ] | Predefined explicit equation | Traffic-theory-based modeling | Predefined structure | Estimation accuracy | Lane-group, approach, and intersection delay |
| Graph-based traffic forecasting [ 31 , 32 , 33 , 34 , 35 , 36 , 37 , 38 ] | Implicit model | Graph-based spatiotemporal learning | Predefined architecture with learned parameters | Prediction accuracy | Node- and link-level traffic states |
| Machine-learning delay models [ 11 , 41 , 42 , 30 ] | Implicit model | Supervised data-driven learning | Predefined model class with learned parameters | Estimation accuracy | Vehicle- or intersection-level delay |
| Semi-empirical delay models [ 43 , 44 ] | Predefined explicit equation | Semi-empirical modeling | Fixed equation with calibrated coefficients | Estimation accuracy | Intersection delay |
| Traffic SR [ 52 , 53 , 55 , 54 ] | Explicit equation | Data-driven symbolic regression | Operator-based search from data | Prediction accuracy and expression complexity | Task-specific traffic relationship |
| Knowledge-guided SR [ 17 , 18 , 19 , 20 ] | Explicit equation | Knowledge-guided symbolic regression | Constraint-guided search from data | Prediction accuracy and general constraints | Task-specific equation |
| Component | Inputs and dimensions | Outputs and dimensions |
| Feature Transformation | Raw movement observations for movements, and movement saturation flows | Transformed observations , containing flow ratio, green ratio, and cycle length |
| Expression Initialization | Initialization prompt, transformed variables, and delay principles | Initial population with candidate expression structures |
| Expression Calibration | A population of candidate expression structures, transformed inputs and traffic volumes for movements, and approach-delay labels | calibrated movement-specific functions |
| Expression Evaluation | calibrated functions, transformed inputs and traffic volumes, approach-delay labels, and delay principles | accuracy scores, physical indicators, overall fitness values, and principle-feedback values |
| Expression Population Update | Parent and offspring populations ( candidate expression structures each) and their overall fitness values | Updated population containing the globally best structures and one current best expression |
| Expression Regeneration | Updated population ( structures), accuracy results, principle feedback, and regeneration prompt | Offspring population with regenerated structures |
| Principle | Requirement | Automated check |
| 1. Required Traffic Variables | must include the movement flow ratio , green ratio , and cycle time . | Confirm that , , and are present in the expression. |
| 2. Monotonicity w.r.t. Flow Ratio | Delay must be non-decreasing in : . | Compute and confirm that every sampled value is real, finite, and non-negative. |
| 3. Monotonicity w.r.t. Green Ratio | Delay must be non-increasing in : . | Compute and confirm that every sampled value is real, finite, and non-positive. |
| 4. Unit Consistency | With dimensionless , , and coefficients, for . | Verify symbolically that . |
| 5. Low-Flow Condition | For , must be finite and non-negative, but need not be zero. | Compute the symbolic limit and confirm that it exists and lies in . |
| 6. Non-Negativity | Delay must remain real, finite, and non-negative over the verification domain. | Evaluate and confirm that every sampled value is real, finite, and non-negative. |
| Intersection | Intergreen (s) | Movements by approach | Phase allocation |
| 1–2 | 24 | S/E/N/W: L, T, R | A: S/N R; B: S/N L, T; C: E/W R; D: E/W L, T |
| 3 | 18 | S: L, T; E: L, T; N: L, T, R; W: L, T | A: S/N L, T; W L; B: N L, T, R; W L; C: E/W L, T |
| 4 | 18 | S: L, T; N: T, R; W: L, R | A: S L, T; N T; B: S L; N T, R; W L; C: S L; W L, R |
| 5 | 18 | S: L, T; E: L, T, R; N: T; W: L, R | A: E/W L, R; B: E L, T, R; W L; C: S L, T; N T; W L |
| 6 | 12 | S: T, R; E: L; N: L, T | A: S T; N L, T; B: S T, R; E L |
| Site | Metric | Webster | Webster-opt | HCM | HCM-opt | Akçelik | Akçelik-opt | CoSyDelay |
| I1 | -0.367 + | + | -0.368 + | + | -0.368 + | + | ||
| RMSE | 12.294 + | + | 12.297 + | + | 12.297 + | + | ||
| MAE | 10.522 + | + | 10.527 + | + | 10.527 + | + | ||
| I2 | -0.516 + | + | -0.516 + | + | -0.516 + | + | ||
| RMSE | 15.220 + | + | 15.220 + | + | 15.220 + | + | ||
| MAE | 12.526 + | + | 12.526 + | + | 12.526 + | + |
| Site | Metric | Linear | RF | XGBoost | AdaBoost | SVR | KNN | GCN | DGAE | GNNUI | GRANDE | ModernNCA | CoSyDelay |
| I1 | 0.784 + | + | + | + | 0.760 + | 0.715 + | + | + | + | + | + | ||
| RMSE | 4.671 + | + | + | + | 5.021 + | 5.522 + | + | + | + | + | + | ||
| MAE | 3.363 + | + | + | + | 3.387 + | 3.872 + | + | + | + | + | + | ||
| I2 | 0.732 + | + | + | + | 0.728 + | 0.694 + | + | + | - | = | - | ||
| RMSE | 6.176 + | + | + | + | 6.223 + | 6.583 + | + | + | - | + | = | ||
| MAE | 4.485 + | - | = | + | 3.953 - | 4.376 + | + | = | - | = | - |
| Model | Oversaturated traffic | Cross-intersection structure transfer | ||||||
| RMSE (s) | MAE (s) | Average Rank | RMSE (s) | MAE (s) | Average Rank | |||
| Webster | 6.00 | 6.44 | ||||||
| Webster-optimized | 3.94 | 4.17 | ||||||
| HCM | 5.11 | 5.25 | ||||||
| HCM-optimized | 2.89 | 2.10 | ||||||
| Akçelik | 5.11 | 5.25 | ||||||
| Model | Beijing | Chengdu | Tianjin |
| Webster | |||
| HCM | |||
| Akçelik | |||
| Webster-optimized | |||
| HCM-optimized | |||
| Akçelik-optimized |
| Method | I1 | I2 | I3 | I4 | I5 | I6 | Average Rank | |
| Input feature representation | ||||||||
| Raw inputs | 2.000 | 6/0/0 | ||||||
| Transformed features (CoSyDelay) | 1.000 | – | ||||||
| Modeling granularity | ||||||||
| Intersection model | 2.167 | 6/0/0 | ||||||
| Approach model | 2.833 | 6/0/0 | ||||||
| Method | RMSE (s) | MAE (s) | Physical compliance | |
| Operon | No | |||
| PySR | No | |||
| GP-GOMEA | No | |||
| CoSyDelay | Yes |
| Setting | I1 | I2 | I3 | I4 | I5 | I6 | Average Rank | |
| LLM backend | ||||||||
| Qwen-Plus | 4.417 | 2/4/0 | ||||||
| Gemini-2.5-Flash | 2.000 | 0/6/0 | ||||||
| GPT-OSS-20B | 3.167 | 1/5/0 | ||||||
| Grok-Code-Fast-1 | 3.750 | 2/4/0 | ||||||
| GPT-4.1-mini (CoSyDelay) | 1.667 | – | ||||||
Intelligent Transportation Systems
Intelligent Transportation Systems apply sensing, communication, AI, and optimization to make transport networks safer and more efficient.
See all 322 papers