IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v47y2015i12p1397-1406.html
   My bibliography  Save this article

A location–allocation problem with concentric circles

Author

Listed:
  • Jack Brimberg
  • Zvi Drezner

Abstract

We consider a continuous location problem for p concentric circles serving a given set of demand points. Each demand point is serviced by the closest circle. The objective is to minimize the sum of weighted distances between demand points and their closest circle. We analyze and solve the problem when demand is uniformly and continuously distributed in a disk and when a finite number of demand points are located in the plane. Heuristic and exact algorithms are proposed for the solution of the discrete demand problem. A much faster heuristic version of the exact algorithm is also proposed and tested. The exact algorithm solves the largest tested problem with 1000 demand points in about 3.5 hours. The faster heuristic version solves it in about 2 minutes.

Suggested Citation

  • Jack Brimberg & Zvi Drezner, 2015. "A location–allocation problem with concentric circles," IISE Transactions, Taylor & Francis Journals, vol. 47(12), pages 1397-1406, December.
    • Handle: RePEc:taf:uiiexx:v:47:y:2015:i:12:p:1397-1406
    DOI: 10.1080/0740817X.2015.1034897
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2015.1034897
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2015.1034897?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:uiiexx:v:47:y:2015:i:12:p:1397-1406. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.