Abstract
This paper presents a continuum dynamic traffic assignment model for a city in which the total cost of the traffic system is minimized: the travelers in the system are organized to choose the route to their destinations that minimizes the total cost of the system. Combined with the objective function, which defines the total cost and constraints such as certain physical and boundary conditions, a continuum model can be formulated as an optimization scheme with a feasible region in the function space. To obtain an admissible locally optimal solution to this problem, we first reformulate the optimization in discrete form and then introduce a heuristic method to solve it. This method converges rapidly with attractive computational cost. Numerical examples are used to demonstrate the effectiveness of the method.
| Original language | English |
|---|---|
| Pages (from-to) | 782-797 |
| Number of pages | 16 |
| Journal | Journal of Advanced Transportation |
| Volume | 48 |
| Issue number | 7 |
| DOIs | |
| State | Published - 1 Nov 2014 |
| Externally published | Yes |
Keywords
- continuum model
- dynamic system optimal
- heuristic method