THE MAXIMAL EXPECTED COVERING LOCATION PROBLEM: REVISITED

The Maximal Expected Coverage Location Problem (MEXCLP) addresses the problem of optimally locating servers so as to maximize the expected coverage of demand while taking into account the possibility that a server may be unable to respond to new demand because the server is answering another call. Three assumptions of MEXCLP (servers operate independently, servers have the same busy probabilities, and server busy probabilities are invariant with respect to their locations) are relaxed in this paper. The hypercube queueing model is embedded in a single node substitution heuristic optimization procedure, to determine a set of server locations which maximize the expected coverage. Results show disagreement between the expected coverage predicted by the MEXCLP model and the hypercube optimization procedure. However, there is substantial agreement between the locations generated by the two procedures. A simple adjustment to the MEXCLP model, based upon random sampling of servers without replacement, is also considered. Results indicate that there is better agreement between the expected coverage predicted by the adjusted model and the hypercube optimization procedure. The quality of the locations generated by the adjusted model, however, is the same as that of those generated by the MEXCLP model.

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00490620
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 31 1990 12:00AM