LeBlanc et al., 1982 - Google Patents
Selection of a trip table which reproduces observed link flowsLeBlanc et al., 1982
- Document ID
- 5375770048604156687
- Author
- LeBlanc L
- Farhangian K
- Publication year
- Publication venue
- Transportation Research Part B: Methodological
External Links
Snippet
In urban traffic management and planning, an important problem is estimating the number of drivers traveling between each origin-destination zone. We review a model due to Nguyen for estimating these numbers of drivers, based on counts of the traffic flows on each street …
- 238000000034 method 0 abstract description 23
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| LeBlanc et al. | Selection of a trip table which reproduces observed link flows | |
| Dial | Bicriterion traffic assignment: basic theory and elementary algorithms | |
| Silman et al. | Planning the route system for urban buses | |
| Kaufman et al. | An iterative routing/assignment method for anticipatory real-time route guidance | |
| Zhu et al. | On the existence of solutions to the dynamic user equilibrium problem | |
| Eklund et al. | A dynamic multi-source Dijkstra's algorithm for vehicle routing | |
| Hai | Sensitivity analysis for queuing equilibrium network flow and its application to traffic control | |
| Papadimitriou et al. | Motion planning on a graph | |
| CN112990648B (en) | Rail transit network operation stability assessment method | |
| Wunderlich et al. | Link travel time prediction for decentralized route guidance architectures | |
| Jaillet | Shortest path problems with node failures | |
| Drezner et al. | Selecting an optimum configuration of one-way and two-way routes | |
| Janson et al. | Equilibrium trip assignment: advantages and implications for practice | |
| CN109461307A (en) | A method of estimating road-section average vehicle flow and OD demand | |
| CN109887280B (en) | Traffic network node criticality assessment method | |
| Rose et al. | An examination of convergence error in equilibrium traffic assignment models | |
| LeBlanc et al. | An accurate and efficient approach to equilibrium traffic assignment on congested networks | |
| CN108986464A (en) | Regional traffic signal control effect appraisal procedure based on Weighted Complex Networks | |
| Shang et al. | Locating the variable message signs by cell transmission model | |
| LeBlanc et al. | An efficient dual approach to the urban road network design problem | |
| Barbour et al. | Estimating an origin-destination table using a method based on shortest augmenting paths | |
| Staves et al. | Incorporating network-based built environmental attributes of walkability and cyclability into accessibility modelling: a pilot study for Greater Manchester | |
| Kiyota et al. | Multistage optimization of reconstruction sequence of highways | |
| Kim et al. | Selection of the optimal traffic counting locations for estimating origin-destination trip matrix | |
| Li | Integration of dynamic vehicle routing and microscopic traffic simulation |