Name
Abstract | ||
|---|---|---|
Continuous demand is generated in a convex polygon. A facility located in the area covers demand within a given radius. The objective is to find the locations for p facilities that cover the maximum demand in the area. A procedure that calculates the total area covered by a set of facilities is developed. A multi start heuristic approach for solving this problem is proposed by applying a gradient search from a randomly generated set of p locations for the facilities. Computational experiments for covering a square area illustrate the effectiveness of the proposed algorithm. Journal of the Operational Research Society (2010) 61, 878-881. doi:10.1057/jors.2009.10 |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1057/jors.2009.10 | JORS |
Keywords | Field | DocType |
location,cover,circle packing | Heuristic,Scheduling (computing),Computer science,Convex polygon,Circle packing,Operations management,Management science | Journal |
Volume | Issue | ISSN |
61 | 5 | 0160-5682 |
Citations | PageRank | References |
9 | 0.55 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zvi Drezner | 1 | 1195 | 140.69 |
| Atsuo Suzuki | 2 | 85 | 7.38 |