An Algebra for the Analysis and Design of Transportation Networks

Helmy H. Baligh, David C. Dellinger and Louis D. Volpp
Additional contact information
Helmy H. Baligh: Duke University, Durham, North Carolina
David C. Dellinger: Duke University, Durham, North Carolina
Louis D. Volpp: Duke University, Durham, North Carolina

Transportation Science, 1972, vol. 6, issue 4, 354-378

Abstract: A transportation network algebra is developed as a set of definitions and rules of logic needed to create a useful, integrated theory for systematic design and development of networks. A network is viewed as the output of the physical components of the transportation system. The algebra is based on the concept of a direct trip as a function, and an indirect trip as the result of the composition of these functions. Special forms of network addition are developed and theorems related to the properties of networks are proved. The algebraic operations and theorems permit the composition and decomposition of networks and the systematic, efficient, and sequential generation of networks and their evaluation. The theorems are on some of the properties to be used in their evaluation, such as: connectedness, coalescence, and the criticalness of stations and trips.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.6.4.354 (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:inm:ortrsc:v:6:y:1972:i:4:p:354-378

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().