The TABenchmark Reference Canon

The models, algorithms, data practices, and protocols that a complete traffic assignment benchmark must cover — compiled family-by-family across ~50 years of transportation research and verified reference-by-reference against Crossref / Semantic Scholar (via refcheck). BibTeX for every entry is in references.bib; the machine-readable canon is references.json.

Tiers — 1: must implement in the benchmark core; 2: should implement as a variant/extension; 3: background, survey, or book (cite, don’t implement). Verified — ✓: metadata verified against publication databases; book: hand-checked @book entry; partial: verified after correcting the originally compiled metadata (corrections are recorded in the entry’s contribution field in references.json).

247 references — 64 tier-1, 134 tier-2, 49 tier-3.

Foundations of Static Equilibrium Assignment

Reference	Title	Venue	Tier	Role	Verified
Wardrop (1952)	Some Theoretical Aspects of Road Traffic Research	Proceedings of the Institution of Civil Engineers, Part II	1	metric/protocol	✓
Beckmann et al. (1956)	Studies in the Economics of Transportation	Yale University Press	1	white-box solver	book
Bureau of Public Roads (1964)	Traffic Assignment Manual	U.S. Department of Commerce, Urban Planning Division	1	network loading	book
Dafermos (1972)	The Traffic Assignment Problem for Multiclass-User Transportation Networks	Transportation Science	1	white-box solver	✓
Smith (1979)	The Existence, Uniqueness and Stability of Traffic Equilibria	Transportation Research Part B: Methodological	1	metric/protocol	✓
Dafermos (1980)	Traffic Equilibrium and Variational Inequalities	Transportation Science	1	white-box solver	✓
Braess (1968)	Über ein Paradoxon aus der Verkehrsplanung	Unternehmensforschung	2	data/scenario	✓
Dafermos & Sparrow (1969)	The Traffic Assignment Problem for a General Network	Journal of Research of the National Bureau of Standards, Series B	2	white-box solver	✓
Aashtiani & Magnanti (1981)	Equilibria on a Congested Transportation Network	SIAM Journal on Algebraic and Discrete Methods	2	white-box solver	✓
Hearn (1982)	The Gap Function of a Convex Program	Operations Research Letters	2	metric/protocol	✓
Nguyen & Dupuis (1984)	An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs	Transportation Science	2	data/scenario	✓
Tobin & Friesz (1988)	Sensitivity Analysis for Equilibrium Network Flow	Transportation Science	2	white-box solver	✓
Rossi et al. (1989)	Entropy Model for Consistent Impact-Fee Assessment	Journal of Urban Planning and Development	2	route choice	✓
Spiess (1990)	Technical Note—Conical Volume-Delay Functions	Transportation Science	2	network loading	✓
Cantarella (1997)	A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand	Transportation Science	2	white-box solver	✓
Gabriel & Bernstein (1997)	The Traffic Equilibrium Problem with Nonadditive Path Costs	Transportation Science	2	white-box solver	✓
Patriksson (2004)	Sensitivity Analysis of Traffic Equilibria	Transportation Science	2	white-box solver	✓
Bar-Gera (2006)	Primal Method for Determining the Most Likely Route Flows in Large Road Networks	Transportation Science	2	route choice	✓
Bar-Gera et al. (2012)	User-equilibrium route flows and the condition of proportionality	Transportation Research Part B: Methodological	2	metric/protocol	✓
Sheffi (1985)	Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods	Prentice-Hall	3	white-box solver	book
Patriksson (1994)	The Traffic Assignment Problem: Models and Methods	VSP (republished by Dover, 2015)	3	survey/context	book
Boyce et al. (2005)	A Retrospective on Beckmann, McGuire and Winsten’s Studies in the Economics of Transportation	Papers in Regional Science	3	survey/context	✓

Link-Based UE Algorithms

Reference	Title	Venue	Tier	Role	Verified
Frank & Wolfe (1956)	An Algorithm for Quadratic Programming	Naval Research Logistics Quarterly	1	white-box solver	✓
LeBlanc et al. (1975)	An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem	Transportation Research	1	white-box solver	✓
Boyce et al. (2004)	Convergence of Traffic Assignments: How Much Is Enough?	Journal of Transportation Engineering	1	metric/protocol	✓
Mitradjieva & Lindberg (2013)	The Stiff Is Moving—Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment	Transportation Science	1	white-box solver	✓
Fukushima (1984)	A Modified Frank-Wolfe Algorithm for Solving the Traffic Assignment Problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Lawphongpanich & Hearn (1984)	Simplicial Decomposition of the Asymmetric Traffic Assignment Problem	Transportation Research Part B: Methodological	2	white-box solver	✓
LeBlanc et al. (1985)	Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs	Transportation Science	2	white-box solver	✓
Florian et al. (1987)	An Efficient Implementation of the “PARTAN” Variant of the Linear Approximation Method for the Network Equilibrium Problem	Networks	2	white-box solver	✓
Hearn et al. (1987)	Restricted Simplicial Decomposition: Computation and Extensions	Mathematical Programming Study	2	white-box solver	✓
Liu et al. (2009)	Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem	Networks and Spatial Economics	2	white-box solver	✓
Leventhal et al. (1973)	A Column Generation Algorithm for Optimal Traffic Assignment	Transportation Science	3	survey/context	✓
Von Hohenbalken (1977)	Simplicial decomposition in nonlinear programming algorithms	Mathematical Programming	3	survey/context	✓
Perederieieva et al. (2015)	A Framework for and Empirical Study of Algorithms for Traffic Assignment	Computers & Operations Research	3	metric/protocol	✓
Patil et al. (2021)	Convergence behavior for traffic assignment characterization metrics	Transportmetrica A: Transport Science	3	metric/protocol	✓
Liu et al. (2023)	An alternating direction method of multipliers for solving user equilibrium problem	European Journal of Operational Research	3	white-box solver	✓

Path-Based and Bush/Origin-Based UE Algorithms

Reference	Title	Venue	Tier	Role	Verified
Jayakrishnan et al. (1994)	A faster path-based algorithm for traffic assignment	Transportation Research Record 1443	1	white-box solver	✓ (manual)
Bar-Gera (2002)	Origin-based algorithm for the traffic assignment problem	Transportation Science 36(4)	1	white-box solver	✓
Dial (2006)	A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration	Transportation Research Part B: Methodological 40(10)	1	white-box solver	✓
Bar-Gera (2010)	Traffic assignment by paired alternative segments	Transportation Research Part B: Methodological 44(8-9)	1	white-box solver	✓
Larsson & Patriksson (1992)	Simplicial decomposition with disaggregated representation for the traffic assignment problem	Transportation Science 26(1)	2	white-box solver	✓
Florian et al. (2009)	A New Look at Projected Gradient Method for Equilibrium Assignment	Transportation Research Record 2090	2	white-box solver	✓
Nie (2010)	A class of bush-based algorithms for the traffic assignment problem	Transportation Research Part B: Methodological 44(1)	2	white-box solver	✓
Gentile (2014)	Local User Cost Equilibrium: a bush-based algorithm for traffic assignment	Transportmetrica A: Transport Science 10(1)	2	white-box solver	✓
Xie & Xie (2016)	New insights and improvements of using paired alternative segments for traffic assignment	Transportation Research Part B: Methodological 93	2	white-box solver	✓
Xie et al. (2018)	A Greedy Path-Based Algorithm for Traffic Assignment	Transportation Research Record 2672(48)	2	white-box solver	✓
Babazadeh et al. (2020)	Reduced gradient algorithm for user equilibrium traffic assignment problem	Transportmetrica A: Transport Science	2	white-box solver	✓
Bertsekas & Gafni (1982)	Projection methods for variational inequalities with application to the traffic assignment problem	Mathematical Programming Study 17	3	survey/context	✓
Xie & Xie (2015)	Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance	Transportation Research Record 2498	3	metric/protocol	✓
Boyles et al. (2025)	Transportation Network Analysis, Volume I: Static and Dynamic Traffic Assignment	arXiv:2502.05182 [math.OC] (open-access textbook, sboyles.github.io)	3	survey/context	✓

Stochastic User Equilibrium and Route Choice

Reference	Title	Venue	Tier	Role	Verified
Dial (1971)	A probabilistic multipath traffic assignment model which obviates path enumeration	Transportation Research	1	network loading	✓
Daganzo & Sheffi (1977)	On stochastic models of traffic assignment	Transportation Science	1	white-box solver	✓
Fisk (1980)	Some developments in equilibrium traffic assignment	Transportation Research Part B: Methodological	1	white-box solver	✓
Powell & Sheffi (1982)	The convergence of equilibrium algorithms with predetermined step sizes	Transportation Science	1	white-box solver	✓
Sheffi & Powell (1982)	An algorithm for the equilibrium assignment problem with random link times	Networks	1	white-box solver	✓
Bell (1995)	Alternatives to Dial’s logit assignment algorithm	Transportation Research Part B: Methodological	2	network loading	✓
Cascetta et al. (1996)	A modified logit route choice model overcoming path overlapping problems: specification and some calibration results for interurban networks	Proceedings of the 13th International Symposium on Transportation and Traffic Theory (ISTTT), Lyon (Pergamon)	2	route choice	book
Damberg et al. (1996)	An algorithm for the stochastic user equilibrium problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Maher & Hughes (1997)	A probit-based stochastic user equilibrium assignment model	Transportation Research Part B: Methodological	2	white-box solver	✓
Maher (1998)	Algorithms for logit-based stochastic user equilibrium assignment	Transportation Research Part B: Methodological	2	white-box solver	✓
Vovsha & Bekhor (1998)	Link-Nested Logit Model of Route Choice: Overcoming Route Overlapping Problem	Transportation Research Record	2	route choice	✓
Ben-Akiva & Bierlaire (1999)	Discrete choice methods and their applications to short term travel decisions	Handbook of Transportation Science (Kluwer Academic Publishers)	2	route choice	✓
Bekhor & Prashker (2001)	Stochastic User Equilibrium Formulation for Generalized Nested Logit Model	Transportation Research Record: Journal of the Transportation Research Board	2	white-box solver	✓
Bekhor & Toledo (2005)	Investigating path-based solution algorithms to the stochastic user equilibrium problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Bekhor et al. (2006)	Evaluation of choice set generation algorithms for route choice models	Annals of Operations Research	2	route choice	✓
Baillon & Cominetti (2008)	Markovian traffic equilibrium	Mathematical Programming	2	white-box solver	✓
Zhou et al. (2012)	C-logit stochastic user equilibrium model: formulations and solution algorithm	Transportmetrica	2	white-box solver	✓
Fosgerau et al. (2013)	A link based network route choice model with unrestricted choice set	Transportation Research Part B: Methodological	2	route choice	✓
Kitthamkesorn & Chen (2013)	A path-size weibit stochastic user equilibrium model	Transportation Research Part B: Methodological	2	white-box solver	✓
Rasmussen et al. (2015)	Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family	Transportation Research Part B: Methodological	2	white-box solver	✓
Watling et al. (2015)	Stochastic user equilibrium with equilibrated choice sets: Part I – Model formulations under alternative distributions and restrictions	Transportation Research Part B: Methodological	2	white-box solver	✓
Prashker & Bekhor (2004)	Route choice models used in the stochastic user equilibrium problem: a review	Transport Reviews	3	survey/context	✓

System Optimum, Congestion Pricing, and Efficiency

Reference	Title	Venue	Tier	Role	Verified
Yang & Huang (1998)	Principle of Marginal-Cost Pricing: How Does It Work in a General Road Network?	Transportation Research Part A: Policy and Practice	1	white-box solver	✓
Roughgarden & Tardos (2002)	How Bad Is Selfish Routing?	Journal of the ACM	1	metric/protocol	✓
Verhoef et al. (1996)	Second-Best Congestion Pricing: The Case of an Untolled Alternative	Journal of Urban Economics	2	data/scenario	✓
Hearn & Ramana (1998)	Solving Congestion Toll Pricing Models	Equilibrium and Advanced Transportation Modelling (Marcotte & Nguyen, eds.), Kluwer	2	white-box solver	✓
Verhoef (2002)	Second-Best Congestion Pricing in General Networks: Heuristic Algorithms for Finding Second-Best Optimal Toll Levels and Toll Points	Transportation Research Part B: Methodological	2	white-box solver	✓
Correa et al. (2004)	Selfish Routing in Capacitated Networks	Mathematics of Operations Research	2	metric/protocol	✓
Lawphongpanich & Hearn (2004)	An MPEC Approach to Second-Best Toll Pricing	Mathematical Programming, Series B	2	white-box solver	✓
Yang & Huang (2004)	The multi-class, multi-criteria traffic network equilibrium and systems optimum problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Jahn et al. (2005)	System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion	Operations Research	2	white-box solver	✓
Youn et al. (2008)	Price of Anarchy in Transportation Networks: Efficiency and Optimality Control	Physical Review Letters	2	metric/protocol	✓
Yang & Wang (2011)	Managing network mobility with tradable credits	Transportation Research Part B: Methodological	2	white-box solver	✓
O’Hare et al. (2016)	Mechanisms That Govern How the Price of Anarchy Varies with Travel Demand	Transportation Research Part B: Methodological	2	metric/protocol	✓
Pigou (1920)	The Economics of Welfare	Macmillan (London)	3	survey/context	book
Knight (1924)	Some Fallacies in the Interpretation of Social Cost	Quarterly Journal of Economics	3	survey/context	✓
Walters (1961)	The Theory and Measurement of Private and Social Cost of Highway Congestion	Econometrica	3	survey/context	✓
Braess et al. (2005)	On a Paradox of Traffic Planning	Transportation Science	3	data/scenario	✓
Roughgarden (2005)	Selfish Routing and the Price of Anarchy	MIT Press	3	survey/context	book
Yang & Huang (2005)	Mathematical and Economic Theory of Road Pricing	Elsevier	3	survey/context	✓

Static Assignment Extensions

Reference	Title	Venue	Tier	Role	Verified
Florian & Nguyen (1974)	A Method for Computing Network Equilibrium with Elastic Demands	Transportation Science	1	white-box solver	✓
Evans (1976)	Derivation and analysis of some models for combining trip distribution and assignment	Transportation Research	1	white-box solver	✓
Mahmassani & Chang (1987)	On Boundedly Rational User Equilibrium in Transportation Systems	Transportation Science	1	route choice	✓
Spiess & Florian (1989)	Optimal strategies: A new assignment model for transit networks	Transportation Research Part B: Methodological	1	white-box solver	✓
Larsson & Patriksson (1995)	An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems	Transportation Research Part B: Methodological	1	white-box solver	✓
Gartner (1980)	Optimal Traffic Assignment with Elastic Demands: A Review Part I. Analysis Framework	Transportation Science	2	white-box solver	✓
Florian & Spiess (1982)	The convergence of diagonalization algorithms for asymmetric network equilibrium problems	Transportation Research Part B: Methodological	2	white-box solver	✓
de Cea & Fernández (1993)	Transit Assignment for Congested Public Transport Systems: An Equilibrium Model	Transportation Science	2	white-box solver	✓
Dial (1996)	Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms	Transportation Science	2	white-box solver	✓
Larsson & Patriksson (1999)	Side constrained traffic equilibrium models — analysis, computation and applications	Transportation Research Part B: Methodological	2	white-box solver	✓
Boyce & Bar-Gera (2004)	Multiclass Combined Models for Urban Travel Forecasting	Networks and Spatial Economics	2	white-box solver	✓
Lo et al. (2006)	Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion	Transportation Research Part B: Methodological	2	white-box solver	✓
Lou et al. (2010)	Robust congestion pricing under boundedly rational user equilibrium	Transportation Research Part B: Methodological	2	white-box solver	✓
Di et al. (2013)	Boundedly rational user equilibria (BRUE): Mathematical formulation and solution sets	Transportation Research Part B: Methodological	2	white-box solver	✓
Nagurney (1993)	Network Economics: A Variational Inequality Approach	Kluwer Academic Publishers	3	survey/context	✓
Boyce (2007)	Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models	Networks and Spatial Economics	3	survey/context	✓
Di & Liu (2016)	Boundedly rational route choice behavior: A review of models and methodologies	Transportation Research Part B: Methodological	3	survey/context	✓

Analytical Dynamic Traffic Assignment

Reference	Title	Venue	Tier	Role	Verified
Vickrey (1969)	Congestion Theory and Transport Investment	American Economic Review	1	white-box solver	✓ (manual)
Merchant & Nemhauser (1978)	A Model and an Algorithm for the Dynamic Traffic Assignment Problems	Transportation Science	1	white-box solver	✓
Friesz et al. (1993)	A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem	Operations Research	1	white-box solver	✓
Ziliaskopoulos (2000)	A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem	Transportation Science	1	white-box solver	✓
Merchant & Nemhauser (1978)	Optimality Conditions for a Dynamic Traffic Assignment Model	Transportation Science	2	white-box solver	✓
Carey (1987)	Optimal Time-Varying Flows on Congested Networks	Operations Research	2	white-box solver	✓
Friesz et al. (1989)	Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem	Operations Research	2	white-box solver	✓
Arnott et al. (1990)	Economics of a Bottleneck	Journal of Urban Economics	2	white-box solver	✓
Janson (1991)	Dynamic traffic assignment for urban road networks	Transportation Research Part B: Methodological	2	white-box solver	✓
Ran et al. (1993)	A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models	Operations Research	2	white-box solver	✓
Smith (1993)	A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks	Transportation Research Part B: Methodological	2	white-box solver	✓
Ghali & Smith (1995)	A model for the dynamic system optimum traffic assignment problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Chen & Hsueh (1998)	A model and an algorithm for the dynamic user-optimal route choice problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Huang & Lam (2002)	Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues	Transportation Research Part B: Methodological	2	white-box solver	✓
Lo & Szeto (2002)	A Cell-Based Variational Inequality Formulation of the Dynamic User Optimal Assignment Problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Friesz & Mookherjee (2006)	Solving the dynamic network user equilibrium problem with state-dependent time shifts	Transportation Research Part B: Methodological	2	white-box solver	✓
Nie (2011)	A Cell-Based Merchant-Nemhauser Model for the System Optimum Dynamic Traffic Assignment Problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Han et al. (2019)	Computing Dynamic User Equilibria on Large-Scale Networks with Software Implementation	Networks and Spatial Economics	2	black-box wrapper	✓
Carey (1992)	Nonconvexity of the dynamic traffic assignment problem	Transportation Research Part B: Methodological	3	metric/protocol	✓
Ran & Boyce (1996)	Modeling Dynamic Transportation Networks: An Intelligent Transportation System Oriented Approach	Springer	3	survey/context	book
Zhu & Marcotte (2000)	On the Existence of Solutions to the Dynamic User Equilibrium Problem	Transportation Science	3	survey/context	✓
Peeta & Ziliaskopoulos (2001)	Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future	Networks and Spatial Economics	3	survey/context	✓
Koch & Skutella (2011)	Nash Equilibria and the Price of Anarchy for Flows over Time	Theory of Computing Systems	3	white-box solver	✓
Zheng & Chiu (2011)	A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem	Transportation Science	3	white-box solver	✓
Han et al. (2013)	Existence of Simultaneous Route and Departure Choice Dynamic User Equilibrium	Transportation Research Part B: Methodological	3	survey/context	✓
Wang et al. (2018)	Dynamic Traffic Assignment: A Review of the Methodological Advances for Environmentally Sustainable Road Transportation Applications	Transportation Research Part B: Methodological	3	survey/context	✓

Dynamic Network Loading Models

Reference	Title	Venue	Tier	Role	Verified
Newell (1993)	A simplified theory of kinematic waves in highway traffic, part I: General theory	Transportation Research Part B: Methodological	1	network loading	✓
Daganzo (1994)	The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory	Transportation Research Part B: Methodological	1	network loading	✓
Daganzo (1995)	The cell transmission model, part II: Network traffic	Transportation Research Part B: Methodological	1	network loading	✓
Lebacque (1996)	The Godunov scheme and what it means for first order traffic flow models	Proceedings of the 13th International Symposium on Transportation and Traffic Theory	1	network loading	✓ (manual)
Yperman (2007)	The Link Transmission Model for dynamic network loading	PhD thesis, Katholieke Universiteit Leuven	1	network loading	book
Tampère et al. (2011)	A generic class of first order node models for dynamic macroscopic simulation of traffic flows	Transportation Research Part B: Methodological	1	network loading	✓
Wu et al. (1998)	The continuous dynamic network loading problem: a mathematical formulation and solution method	Transportation Research Part B: Methodological	2	network loading	✓
Jin & Zhang (2003)	On the distribution schemes for determining flows through a merge	Transportation Research Part B: Methodological	2	network loading	✓
Daganzo (2005)	A variational formulation of kinematic waves: basic theory and complex boundary conditions	Transportation Research Part B: Methodological	2	network loading	✓
Gentile (2010)	The General Link Transmission Model for Dynamic Network Loading and a Comparison with the DUE Algorithm	New Developments in Transport Planning: Advances in Dynamic Traffic Assignment (Edward Elgar)	2	network loading	✓
Flötteröd & Rohde (2011)	Operational macroscopic modeling of complex urban road intersections	Transportation Research Part B: Methodological	2	network loading	✓
Ban et al. (2012)	Continuous-time point-queue models in dynamic network loading	Transportation Research Part B: Methodological	2	network loading	✓
Ma et al. (2014)	Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks	Transportation Research Part B: Methodological	2	network loading	✓
Raadsen et al. (2016)	An efficient and exact event-based algorithm for solving simplified first order dynamic network loading problems in continuous time	Transportation Research Part B: Methodological	2	network loading	✓
Lighthill & Whitham (1955)	On kinematic waves. II. A theory of traffic flow on long crowded roads	Proceedings of the Royal Society of London. Series A	3	survey/context	✓
Richards (1956)	Shock waves on the highway	Operations Research	3	survey/context	✓
Daganzo (1995)	Properties of link travel time functions under dynamic loads	Transportation Research Part B: Methodological	3	metric/protocol	✓
Nie & Zhang (2005)	A comparative study of some macroscopic link models used in dynamic traffic assignment	Networks and Spatial Economics	3	metric/protocol	✓
Corthout et al. (2012)	Non-unique flows in macroscopic first-order intersection models	Transportation Research Part B: Methodological	3	metric/protocol	✓
van Wageningen-Kessels et al. (2015)	Genealogy of traffic flow models	EURO Journal on Transportation and Logistics	3	survey/context	✓
Jin (2021)	Introduction to Network Traffic Flow Theory: Principles, Concepts, Models, and Methods	Elsevier	3	survey/context	book

Simulation-Based DTA and Software Systems

Reference	Title	Venue	Tier	Role	Verified
Jayakrishnan et al. (1994)	An evaluation tool for advanced traffic information and management systems in urban networks	Transportation Research Part C	1	black-box wrapper	✓
Peeta & Mahmassani (1995)	System optimal and user equilibrium time-dependent traffic assignment in congested networks	Annals of Operations Research	1	white-box solver	✓
Ben-Akiva et al. (2001)	Network State Estimation and Prediction for Real-Time Traffic Management	Networks and Spatial Economics	1	black-box wrapper	partial
Zhou & Taylor (2014)	DTALite: A queue-based mesoscopic traffic simulator for fast model evaluation and calibration	Cogent Engineering	1	black-box wrapper	✓
Horni et al. (2016)	The Multi-Agent Transport Simulation MATSim	Ubiquity Press	1	black-box wrapper	✓
Lopez et al. (2018)	Microscopic Traffic Simulation using SUMO	IEEE Intelligent Transportation Systems Conference (ITSC)	1	black-box wrapper	✓
Gawron (1998)	An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model	International Journal of Modern Physics C	2	white-box solver	✓
Ziliaskopoulos & Waller (2000)	An Internet-based geographic information system that integrates data, models and users for transportation applications	Transportation Research Part C	2	black-box wrapper	✓
Mahmassani (2001)	Dynamic network traffic assignment and simulation methodology for advanced system management applications	Networks and Spatial Economics	2	black-box wrapper	✓
Nagel & Rickert (2001)	Parallel implementation of the TRANSIMS micro-simulation	Parallel Computing	2	black-box wrapper	✓
Sbayti et al. (2007)	Efficient Implementation of Method of Successive Averages in Simulation-Based Dynamic Traffic Assignment Models for Large-Scale Network Applications	Transportation Research Record	2	route choice	✓
Lu et al. (2009)	Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Casas et al. (2010)	Traffic Simulation with Aimsun	Fundamentals of Traffic Simulation (Springer, ed. Barceló)	2	black-box wrapper	✓
Flötteröd et al. (2011)	Bayesian Demand Calibration for Dynamic Traffic Simulations	Transportation Science	2	metric/protocol	✓
Osorio & Bierlaire (2013)	A simulation-based optimization framework for urban transportation problems	Operations Research	2	metric/protocol	✓
Lu et al. (2015)	An enhanced SPSA algorithm for the calibration of Dynamic Traffic Assignment models	Transportation Research Part C	2	metric/protocol	✓
Antoniou et al. (2016)	Towards a generic benchmarking platform for origin-destination flows estimation/updating algorithms: Design, demonstration and validation	Transportation Research Part C	2	metric/protocol	✓
Auld et al. (2016)	POLARIS: Agent-based modeling framework development and implementation for integrated travel demand and network and operations simulations	Transportation Research Part C	2	black-box wrapper	✓
Ameli et al. (2020)	Cross-comparison of convergence algorithms to solve trip-based dynamic traffic assignment problems	Computer-Aided Civil and Infrastructure Engineering	2	metric/protocol	✓
Barceló (2010)	Fundamentals of Traffic Simulation	Springer (International Series in Operations Research & Management Science)	3	survey/context	book
Chiu et al. (2011)	Dynamic Traffic Assignment: A Primer	Transportation Research Circular E-C153, Transportation Research Board	3	survey/context	✓

Day-to-Day Dynamics and Learning Processes

Reference	Title	Venue	Tier	Role	Verified
Horowitz (1984)	The stability of stochastic equilibrium in a two-link transportation network	Transportation Research Part B: Methodological	1	white-box solver	✓
Smith (1984)	The stability of a dynamic model of traffic assignment — an application of a method of Lyapunov	Transportation Science	1	white-box solver	✓
Cascetta (1989)	A stochastic process approach to the analysis of temporal dynamics in transportation networks	Transportation Research Part B: Methodological	1	white-box solver	✓
Friesz et al. (1994)	Day-to-day dynamic network disequilibria and idealized traveler information systems	Operations Research	1	white-box solver	✓
Cantarella & Cascetta (1995)	Dynamic processes and equilibrium in transportation networks: towards a unifying theory	Transportation Science	1	white-box solver	✓
He et al. (2010)	A link-based day-to-day traffic assignment model	Transportation Research Part B: Methodological	1	white-box solver	✓
Smith & Watling (2016)	A route-swapping dynamical system and Lyapunov function for stochastic user equilibrium	Transportation Research Part B: Methodological	1	white-box solver	✓
Li et al. (2024)	Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice	Transportation Science	1	white-box solver	✓
Cascetta & Cantarella (1991)	A day-to-day and within-day dynamic stochastic assignment model	Transportation Research Part A: General	2	white-box solver	✓
Davis & Nihan (1993)	Large population approximations of a general stochastic traffic assignment model	Operations Research	2	white-box solver	✓
Zhang & Nagurney (1996)	On the local and global stability of a travel route choice adjustment process	Transportation Research Part B: Methodological	2	white-box solver	✓
Watling (1999)	Stability of the stochastic equilibrium assignment problem: a dynamical systems approach	Transportation Research Part B: Methodological	2	white-box solver	✓
Hazelton & Watling (2004)	Computation of equilibrium distributions of Markov traffic-assignment models	Transportation Science	2	metric/protocol	✓
Yang & Zhang (2009)	Day-to-day stationary link flow pattern	Transportation Research Part B: Methodological	2	white-box solver	✓
Bie & Lo (2010)	Stability and attraction domains of traffic equilibria in a day-to-day dynamical system formulation	Transportation Research Part B: Methodological	2	white-box solver	✓
Guo & Liu (2011)	Bounded rationality and irreversible network change	Transportation Research Part B: Methodological	2	white-box solver	✓
He & Liu (2012)	Modeling the day-to-day traffic evolution process after an unexpected network disruption	Transportation Research Part B: Methodological	2	white-box solver	✓
Cantarella & Watling (2016)	Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete- and continuous-time models	EURO Journal on Transportation and Logistics	2	white-box solver	✓
Watling (1996)	Asymmetric problems and stochastic process models of traffic assignment	Transportation Research Part B: Methodological	3	metric/protocol	✓
Jha et al. (1998)	Perception updating and day-to-day travel choice dynamics in traffic networks with information provision	Transportation Research Part C: Emerging Technologies	3	route choice	✓
Watling & Hazelton (2003)	The dynamics and equilibria of day-to-day assignment models	Networks and Spatial Economics	3	survey/context	✓
Cominetti et al. (2010)	A payoff-based learning procedure and its application to traffic games	Games and Economic Behavior	3	route choice	✓
Parry & Hazelton (2013)	Bayesian inference for day-to-day dynamic traffic models	Transportation Research Part B: Methodological	3	metric/protocol	✓
Hazelton & Parry (2016)	Statistical methods for comparison of day-to-day traffic models	Transportation Research Part B: Methodological	3	metric/protocol	✓
Cantarella et al. (2019)	Dynamics and Stochasticity in Transportation Systems: Tools for Transportation Network Modelling	Elsevier	3	survey/context	book

Machine-Learning-Based Traffic Assignment

Reference	Title	Venue	Tier	Role	Verified
Liu et al. (2023)	End-to-end learning of user equilibrium with implicit neural networks	Transportation Research Part C: Emerging Technologies	1	black-box wrapper	✓
Rahman & Hasan (2023)	Data-Driven Traffic Assignment: A Novel Approach for Learning Traffic Flow Patterns Using Graph Convolutional Neural Network	Data Science for Transportation (Springer)	1	black-box wrapper	✓
Liu & Meidani (2024)	End-to-end heterogeneous graph neural networks for traffic assignment	Transportation Research Part C: Emerging Technologies	1	black-box wrapper	✓
Xu et al. (2024)	A unified dataset for the city-scale traffic assignment model in 20 U.S. cities	Scientific Data (Nature)	1	data/scenario	✓
Bertsimas et al. (2015)	Data-driven estimation in equilibrium using inverse optimization	Mathematical Programming	2	white-box solver	✓
Krichene et al. (2015)	Online Learning of Nash Equilibria in Congestion Games	SIAM Journal on Control and Optimization	2	route choice	✓
Wu et al. (2018)	Hierarchical travel demand estimation using multiple data sources: A forward and backward propagation algorithmic framework on a layered computational graph	Transportation Research Part C: Emerging Technologies	2	white-box solver	✓
Agrawal et al. (2019)	Differentiable Convex Optimization Layers	NeurIPS	2	white-box solver	✓
Ma et al. (2020)	Estimating multi-class dynamic origin-destination demand through a forward-backward algorithm on computational graphs	Transportation Research Part C: Emerging Technologies	2	white-box solver	✓
Shou et al. (2022)	Multi-agent reinforcement learning for Markov routing games: A new modeling paradigm for dynamic traffic assignment	Transportation Research Part C: Emerging Technologies	2	route choice	✓
Patwary et al. (2023)	Iterative Backpropagation Method for Efficient Gradient Estimation in Bilevel Network Equilibrium Optimization Problems	Transportation Science	2	white-box solver	✓
Liu & Meidani (2024)	Heterogeneous Graph Sequence Neural Networks for Dynamic Traffic Assignment	arXiv (2408.04131)	2	black-box wrapper	✓
Jungel et al. (2025)	WardropNet: Traffic Flow Predictions via Equilibrium-Augmented Learning	ICLR	2	black-box wrapper	✓
Lassen et al. (2025)	Learning traffic flows: Graph Neural Networks for Metamodelling Traffic Assignment	MT-ITS 2025 (IEEE); arXiv:2505.11230	2	black-box wrapper	✓
Liu & Yin (2025)	End-to-End Learning of User Equilibrium: Expressivity, Generalization, and Optimization	Transportation Science	2	metric/protocol	✓
Wang et al. (2025)	Scalable and reliable multi-agent reinforcement learning for traffic assignment	IEEE ITSC 2025; arXiv:2506.17029	2	route choice	partial
Ameli et al. (2026)	From Optimization to Prediction: Transformer-Based Path-Flow Estimation to the Traffic Assignment Problem	Transportation Research Part C: Emerging Technologies	2	black-box wrapper	partial
Amos & Kolter (2017)	OptNet: Differentiable Optimization as a Layer in Neural Networks	ICML	3	survey/context	✓
Bai et al. (2019)	Deep Equilibrium Models	NeurIPS	3	survey/context	✓
Xue et al. (2025)	Data Science in Transportation Networks with Graph Neural Networks: A Review and Outlook	Data Science for Transportation (Springer)	3	survey/context	partial

Data, OD Estimation, Calibration, and Benchmarking Practice

Reference	Title	Venue	Tier	Role	Verified
Van Zuylen & Willumsen (1980)	The most likely trip matrix estimated from traffic counts	Transportation Research Part B: Methodological	1	white-box solver	✓
Cascetta (1984)	Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator	Transportation Research Part B: Methodological	1	white-box solver	✓
Spiess (1990)	A gradient approach for the O-D matrix adjustment problem	Publication CRT-693, Centre de Recherche sur les Transports, Universite de Montreal	1	white-box solver	book
Spall (1992)	Multivariate stochastic approximation using a simultaneous perturbation gradient approximation	IEEE Transactions on Automatic Control	1	white-box solver	✓
Yang et al. (1992)	Estimation of origin-destination matrices from link traffic counts on congested networks	Transportation Research Part B: Methodological	1	white-box solver	✓
Cascetta et al. (1993)	Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts	Transportation Science	1	white-box solver	✓
Balakrishna et al. (2007)	Offline calibration of dynamic traffic assignment: Simultaneous demand-and-supply estimation	Transportation Research Record	1	black-box wrapper	✓
Stabler et al. (2016)	Transportation Networks for Research	GitHub repository	1	data/scenario	book
Eckman et al. (2023)	SimOpt: A testbed for simulation-optimization experiments	INFORMS Journal on Computing	1	metric/protocol	✓
Ryu et al. (2025)	BO4Mob: Bayesian Optimization Benchmarks for High-Dimensional Urban Mobility Problem	arXiv:2510.18824 (NeurIPS D&B submission)	1	data/scenario	✓
Maher (1983)	Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach	Transportation Research Part B: Methodological	2	white-box solver	✓
Spiess (1987)	A maximum likelihood model for estimating origin-destination matrices	Transportation Research Part B: Methodological	2	white-box solver	✓
Bell (1991)	The estimation of origin-destination matrices by constrained generalised least squares	Transportation Research Part B: Methodological	2	white-box solver	✓
Yang (1995)	Heuristic algorithms for the bilevel origin-destination matrix estimation problem	Transportation Research Part B: Methodological	2	white-box solver	✓
Vardi (1996)	Network tomography: Estimating source-destination traffic intensities from link data	Journal of the American Statistical Association	2	white-box solver	✓
Bell et al. (1997)	A stochastic user equilibrium path flow estimator	Transportation Research Part C: Emerging Technologies	2	white-box solver	✓
Tebaldi & West (1998)	Bayesian inference on network traffic using link count data	Journal of the American Statistical Association	2	white-box solver	✓
Yang & Zhou (1998)	Optimal traffic counting locations for origin-destination matrix estimation	Transportation Research Part B: Methodological	2	metric/protocol	✓
Ashok & Ben-Akiva (2000)	Alternative Approaches for Real-Time Estimation and Prediction of Time-Dependent Origin–Destination Flows	Transportation Science	2	white-box solver	✓
Cascetta & Postorino (2001)	Fixed Point Approaches to the Estimation of O/D Matrices Using Traffic Counts on Congested Networks	Transportation Science	2	white-box solver	✓
Dowling et al. (2004)	Guidelines for Calibration of Microsimulation Models: Framework and Applications	Transportation Research Record: Journal of the Transportation Research Board	2	metric/protocol	✓
Hazelton (2015)	Network tomography for integer-valued traffic	Annals of Applied Statistics	2	white-box solver	✓
Ma & Qian (2018)	Estimating multi-year 24/7 origin-destination demand using high-granular multi-source traffic data	Transportation Research Part C: Emerging Technologies	2	white-box solver	✓
Osorio (2019)	High-dimensional offline origin-destination (OD) demand calibration for stochastic traffic simulators of large-scale road networks	Transportation Research Part B: Methodological	2	black-box wrapper	✓
Camargo (2024)	AequilibraE: Transportation modeling in Python	Open-source software	2	black-box wrapper	book
Cascetta & Nguyen (1988)	A unified framework for estimating or updating origin/destination matrices from traffic counts	Transportation Research Part B: Methodological	3	survey/context	✓

---

Compiled by a 12-family literature sweep with per-reference verification, then extended by a citation-graph completeness sweep (forward + backward citations of every canon entry via OpenAlex, plus per-family keyword searches; candidates filtered by skeptical judging and verified against Crossref). 0 references failed verification. Cross-family duplicates were merged (a reference appears in the family where it is most load-bearing; references.json records all its families). Generated by tools/generate_references.py — edit the JSON, not this file.