An equilibrium algorithm for the spatial aggregation problem of traffic assignment
An equilibrium algorithm for the spatial aggregation problem of traffic assignment
- New search for: Daganzo, Carlos F.
- New search for: Daganzo, Carlos F.
Abstract Present traffic assignment methods require that all possible origins and destinations of trips taking place within a study area be represented as if they were taking place to and from a small set of points or centroids. Each centroid is supposed to represent the location of all trip-ends within a given zone, and this necessarily misrepresents points located at the edges of the zone. In order to alleviate this problem (which we refer to as the spatial aggregation problem) one could use smaller zones and more centroids, but existing traffic assignment algorithms cannot efficiently handle many centroids. This paper introduces an algorithm procedure which is designed to handle a substantially larger number of centroids. In the paper that follows, the technique is further developed to take into account a continuous distribution of population.
Document information
An equilibrium algorithm for the spatial aggregation problem of traffic assignment
Transportation Research Part B: Methodological ; 14 , 3 ; 221-228
1979-05-29
8 pages
Article (Journal)
Electronic Resource
English
Similar titles
Reduced gradient algorithm for user equilibrium traffic assignment problem
| Taylor & Francis Verlag | 2020
A Distributed Algorithm for the Dynamic Traffic Equilibrium Assignment Problem
| British Library Conference Proceedings | 1996
Algorithm for Equilibrium Transit Assignment Problem
| Transportation Research Record | 2005
Algorithm for Equilibrium Transit Assignment Problem
| Online Contents | 2005
Algorithm for Equilibrium Transit Assignment Problem
| Transportation Research Record | 2005