Exact local solution of the continuous network design problem via stochastic user equilibrium assignment
- 1 February 1994
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 28 (1) , 61-75
- https://doi.org/10.1016/0191-2615(94)90031-0
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- An efficient approach to solving the road network equilibrium traffic assignment problemPublished by Elsevier ,2002
- A bilevel programming algorithm for exact solution of the network design problem with user-optimal flowsTransportation Research Part B: Methodological, 1986
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraintsPublished by Springer Nature ,1982
- Selected node-pair analysis in dial's assignment algorithmTransportation Research Part B: Methodological, 1981
- Some developments in equilibrium traffic assignmentTransportation Research Part B: Methodological, 1980
- The existence, uniqueness and stability of traffic equilibriaTransportation Research Part B: Methodological, 1979
- Continuous equilibrium network design modelsTransportation Research Part B: Methodological, 1979
- An extension of Dial's algorithm utilizing a model of tripmakers' perceptionsTransportation Research, 1977
- A probabilistic multipath traffic assignment model which obviates path enumerationTransportation Research, 1971
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952