Return
A general algorithm for traffic assignment problems with continuously distributed user attributes
DOI:10.1016/j.trb.2026.103465.png)
Abstract
En 中文
• General algorithm for traffic assignment with continuous user attributes. • Avoids multi-class discretization via continuous aggregation of route choices. • Supports multiple attributes and non-additive, non-separable generalized costs. • Demonstrates efficiency and robustness on large-scale benchmark networks.
Keywords:
Traffic assignment
Continuous user attributes
Route choice
Generalized costs
Large-scale networks
Journal
T
IF:
0
Papers:
78
Citations:
0

