Network design application of an extraction algorithm for network aggregation.

Auteur(s)
Haghani, A.E. & Daskin, M.S.
Jaar
Samenvatting

The performance of a network extraction algorithm is described, and the algorithm is tested by using the network design problem. A network is chosen as the original network and is aggregated at different levels. The results of the optimal decision making under a common set of alternative actions are then compared against the original and the aggregated networks. The results suggest that the network aggregation algorithm is a useful tool in simplifying networks to reduce the computational burden associated with the network design problem, and to allow a broader range of policy options to be tested in a fixed amount of computer time than would be allowed by using the original disaggregated network. (A)

Publicatie aanvragen

7 + 3 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
C 11913 (In: C 11908 S) /72 / IRRD 281555
Uitgave

In: Transportation forecasting : analysis and quantitative methods, Transportation Research Record TRR 944, p. 37-46, 7 ref.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.