Optimal Location-Relocation Decisions on Stochastic Networks

Oded Berman and Mina R. Rahnama
Additional contact information
Oded Berman: The University of Calgary, Calgary, Alberta, Canada
Mina R. Rahnama: The University of Calgary, Calgary, Alberta, Canada

Transportation Science, 1985, vol. 19, issue 3, 203-221

Abstract: This paper deals with stochastic transportation networks in which links' travel times are random variables. Transitions among states of the network (each state differs from any other state by at least one link with different travel time) are assumed Markovian. The problem is to find an optimal location-relocation decision for p mobile servers in such a network. The criterion is to minimize the long-term expected average cost in units of time per period taking into account both response times and relocation costs. The paper generalizes its predecessor (Berman, O., A. R. Odoni. 1982. Locating servers on a network with Markovian properties. Networks 12 73--86.), by permitting the chosen set of locations in a given state of the network to depend on the former state of the network. Markovian decision theory is employed with the problem's special structure used to reduce the complexity of the resulting algorithm.

Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.3.203 (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:19:y:1985:i:3:p:203-221

Access Statistics for this article

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