Applying Branch-and-Bound Technique to Route Choice Set Generation
- 1 January 2006
- journal article
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 1985, 19-28
- https://doi.org/10.3141/1985-03
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Path enumeration by finding the constrained K-shortest pathsTransportation Research Part B: Methodological, 2005
- Route Choice Models Used in the Stochastic User Equilibrium Problem: A ReviewTransport Reviews, 2004
- Link-Nested Logit Model of Route Choice: Overcoming Route Overlapping ProblemTransportation Research Record: Journal of the Transportation Research Board, 1998
- Investigation of Stochastic Network Loading ProceduresTransportation Research Record: Journal of the Transportation Research Board, 1998
- Stochastic User Equilibrium Assignment with Explicit Path Enumeration: Comparison of Models and AlgorithmsIFAC Proceedings Volumes, 1997
- Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic ApproachTransportation Research Record: Journal of the Transportation Research Board, 1997
- An algorithm for the ranking of shortest pathsEuropean Journal of Operational Research, 1993
- An algorithm for the equilibrium assignment problem with random link timesNetworks, 1982
- A note on two problems in connexion with graphsNumerische Mathematik, 1959