IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v23y1989i4p277-287.html
   My bibliography  Save this article

The Maximal Expected Covering Location Problem: Revisited

Author

Listed:
  • Rajan Batta

    (State University of New York at Buffalo, Buffalo, New York)

  • June M. Dolan

    (Carrier Corporation, Syracuse, New York)

  • Nirup N. Krishnamurthy

    (State University of New York at Buffalo, Buffalo, New York)

Abstract

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 of servers being unavailable when a call enters the service system. In this paper, an attempt is made to relax three of MEXCLP's assumptions: servers operate independently, servers have the same busy probabilities, and server busy probabilities are invariant with respect to their locations. We embed the hypercube queueing model in a single node substitution heuristic optimization procedure, to determine a set of server locations which “maximize” the expected coverage. Our empirical findings indicate that there is disagreement between the expected coverage predicted by the MEXCLP model and the hypercube optimization procedure. There is substantial agreement, however, between the locations generated by the two procedures. We also consider a simple “adjustment” to the MEXCLP model, based upon random sampling of servers without replacement; the same adjustment has been used previously to derive a hypercube approximation procedure. We discuss modifications and enhancements to the MEXCLP's heuristic solution procedure for this adjusted model. Our empirical findings indicate that there is better agreement between the expected coverage predicted by the adjusted model and the hypercube optimization procedure. The locations generated by the adjusted model, however, are of the same overall quality as those generated by the MEXCLP model. Readers should view the results of this paper in light of the fact that we are able to relax the MEXCLP by assuming that the operating characteristics of the service system fit the description of the hypercube queueing model, such as Poisson arrivals and exponential service times, which may not be strictly true in practice.

Suggested Citation

  • Rajan Batta & June M. Dolan & Nirup N. Krishnamurthy, 1989. "The Maximal Expected Covering Location Problem: Revisited," Transportation Science, INFORMS, vol. 23(4), pages 277-287, November.
  • Handle: RePEc:inm:ortrsc:v:23:y:1989:i:4:p:277-287
    DOI: 10.1287/trsc.23.4.277
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.23.4.277
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.23.4.277?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:23:y:1989:i:4:p:277-287. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.