Multiple paths through a network

Britton Harris ()

ERSA conference papers from European Regional Science Association

Abstract: The most sophisticated iterative algorithm for balancing network congestion for a given set of desired vehicle movement from origins to destinations can generate thousands of paths of equal cost to connect a single O-D pair. Some sets of paths are combinations of minor variations on one main path, while other sets contain various degrees of difference, possibly up to complete independence. Present methods for comparing paths do not take into account the multi-dimensional nature of similarities and differences between paths, or the different character of sets of paths - especially from a geographic point of view. I develop a battery of methods of making comparisons, and apply them to illustrative sets of paths identified in the highly disaggregated Chicago network. I begin a discussion of how these comparisons might be used to throw light on problems of network aggregation and of discrete choice of route among populations of users.

Date: 2002-08
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www-sre.wu.ac.at/ersa/ersaconfs/ersa02/cd-rom/papers/138.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wiw:wiwrsa:ersa02p138

Access Statistics for this paper

More papers in ERSA conference papers from European Regional Science Association Welthandelsplatz 1, 1020 Vienna, Austria.
Bibliographic data for series maintained by Gunther Maier ().