Locating new passenger facilities on a transportation network
This paper examines the problem of locating additional passenger facilities on a transportation network to supplement ones that already exist. A distinction is made between "supporting" facilities which operate only in concert with already existing ones and "new" facilities which are self-sufficient and operate independently. It is shown that, when the objective is to maximize the utility of travel times to all users, at least one set of optimal locations for the new facilities exist on the nodes of the network if the utility function for travel times is convex. This result is proven under very general conditions including the assumption of a probabilistic transportation network, i.e. a network where travel times on network branches are random variables. A straightforward algorithm for solving a specific simple case is also provided and the results are illustrated by examples.
Year of publication: |
1979
|
---|---|
Authors: | Mirchandani, Pitu B. ; Odoni, Amedeo R. |
Published in: |
Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 13.1979, 2, p. 113-122
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Locations of medians on stochastic networks
Mirchandani, Pitu B., (1979)
-
Truck scheduling for solid waste collection in the city of Porto Alegre, Brazil
Li, Jing-Quan, (2008)
-
Truck schedule recovery for solid waste collection in Porto Alegre, Brazil
Li, Jing-quan, (2008)
- More ...