Covering continuous demand in the plane |
| |
Authors: | Z Drezner A Suzuki |
| |
Institution: | 1.California State University – Fullerton,Fullerton, CA,USA;2.Nanzan University,Aichi,Japan |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|