01516122

Component

https://doi.org/10.3141/2466-14

In this work, deterministic and stochastic optimization methods are tested for solving the dynamic demand estimation problem. All the adopted methods demonstrate difficulty in reproducing the correct traffic regime, especially if the seed matrix is not sufficiently close to the real one. Therefore, a new and intuitive procedure to specify an opportune starting seed matrix is proposed: it is a two-step procedure based on the concept of dividing the problem into small problems, with a focus on specific origin–destination (O-D) pairs in different steps. Specifically, the first step focuses on the optimization of a subset of O-D variables (the ones that generate the higher flows or the ones that generate bottlenecks on the network). In the second step the optimization works on all the O-D pairs, with the matrix derived from the first step as starting matrix. In this way it is possible to use a performance optimization method for every step; this technique improves the performance of the method and the quality of the result with respect to the classical one-step approach. The procedure was tested on the real-world network of Antwerp, Belgium, and demonstrated its efficacy in combination with different optimization methods.

01557688

14-3672

English

pp 125–133

2014

Transportation Research Record: Journal of the Transportation Research Board

9780309295581

Print

Figures (4) ; Maps; References (34) ; Tables (3)

Bottlenecks; Dynamic models; Optimization; Origin and destination; Route choice; Stochastic processes; Traffic simulation; Travel demand

Antwerp (Belgium)

Data and Information Technology; Highways; Operations and Traffic Management; Planning and Forecasting; I72: Traffic and Transport Planning; I73: Traffic Control

TRIS, TRB, ATRI

Jan 27 2014 3:15PM

• Access and Connectivity Trade-Offs in Transit Stop Location
• Capacitated Centralized Carrier Collaboration Multihub Location Problem: Tabu Search Approach
• Capacity Estimation in Support of Mesoscopic Simulation as Part of Dynamic Traffic Assignment Models
• Dual-Route Distribution Strategy with Supply Chain Disruption
• High-Speed Train Network Routing with Column Generation
• Initializing the Traffic Assignment Problem by Zone Aggregation and Disaggregation
• Modeling Corridor and Growth Pole Coevolution in Regional Transportation Network
• Modeling Network Growth with Scaling Laws in a Linear Monocentric City
• Park-and-Ride Network Equilibrium with Heterogeneous Commuters and Parking Space Constraint
• Properties of Dynamic Freeway Network Flexibility Model
• Routing Policy Choice Set Generation in Stochastic Time-Dependent Networks: Case Studies for Stockholm, Sweden, and Singapore
• Simulation Framework for Modeling Large-Scale Flexible Transit Systems
• Subnetwork Analysis for Dynamic Traffic Assignment Models: Strategy for Estimating Demand at Subnetwork Boundaries
• Transit Route Design Solved with Wireless Data Collection Algorithms
• Travel Time Distribution Under Interrupted Flow and Application to Travel Time Reliability
• Unified Route Choice Framework: Specification and Application to Urban Traffic Control