A location–allocation problem with concentric circles

Jack Brimberg and Zvi Drezner

IISE Transactions, 2015, vol. 47, issue 12, 1397-1406

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.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2015.1034897 (text/html)
Access to full text is restricted to subscribers.

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:taf:uiiexx:v:47:y:2015:i:12:p:1397-1406

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2015.1034897

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().