Locating Discretionary Service Facilities Based on Probabilistic Customer Flows

Oded Berman, Dmitry Krass and Chen Wei Xu
Additional contact information
Oded Berman: University of Toronto, Division of Management and Economics at Scarborough and the Facility of Management, Toronto, Ontario, M5S 1V4, Canada
Dmitry Krass: University of Toronto, Faculty of Management, Toronto, Ontario M5S 1V4, Canada
Chen Wei Xu: University of Toronto, Faculty of Management, Toronto, Ontario M5S 1V4, Canada

Transportation Science, 1995, vol. 29, issue 3, 276-290

Abstract: In this paper, we consider the problem of locating discretionary facilities on a network. In contrast to previous work in the area, we no longer assume that information on customers' flows along all paths of the network is known (in practice such information is rarely available). Assuming that the fraction of customers that travel from any node to any adjacent node in the network is available, the problem of locating the facilities so as to maximize the fraction of customers that pass by a facility before reaching their destination is formulated as a nonlinear Integer Program. It is shown that by employing the theory of constrained Markov Decision Processes this problem can be reformulated as a linear Mixed Integer Program. The paper presents some preliminary computational results for this formulation as well as results for a greedy heuristic algorithm.

Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.29.3.276 (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:29:y:1995:i:3:p:276-290

Access Statistics for this article

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