Location-Relocation of Mobile Facilities on a Stochastic Network

O. Berman and B. LeBlanc
Additional contact information
O. Berman: The University of Calgary, Calgary, Alberta, Canada
B. LeBlanc: The University of Calgary, Calgary, Alberta, Canada

Transportation Science, 1984, vol. 18, issue 4, 315-330

Abstract: In this paper we deal with networks whose link travel times are not constant but undergo random changes. As a result of these changes the network may be in a finite number of discrete states. The paper contains a heuristic that finds the optimal set of locations for a set a facilities (servers), which may be moved, at a cost, in response to changes in the state of the network. The heuristic is suitable for a general number of facilities (previous research dealt with a single facility). The heuristic, which executes in polynomial time, is compared to the exact solution of the integer linear programming version of the problem for a series of small examples. For larger examples, the solution of the heuristic is compared to several bounds. An efficient method for performing sensitivity analysis is also indicated.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.18.4.315 (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:18:y:1984:i:4:p:315-330

Access Statistics for this article

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