LOCATING DISCRETIONARY SERVICE FACILITIES BASED ON PROBABILISTIC CUSTOMER FLOWS

This problem considers the problem of locating discretionary facilities on a network. 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.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Berman, O
    • Krass, D
    • Xu, C W
  • Publication Date: 1995-8

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00712559
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 10 1995 12:00AM