.png){kind=icon}
.png){kind=icon}
Return
The variable radius covering problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.03.046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose a covering problem where the covering radius of a facility is controlled by the decision-maker; the cost of achieving a certain covering distance is assumed to be a monotonically increasing function of the distance (i.e., it costs more to establish a facility with a greater covering radius). The problem is to cover all demand points at a minimum cost by finding optimal number, locations and coverage radii for the facilities. Both, the planar and discrete versions of the model are considered. Heuristic approaches are suggested for solving large problems in the plane. These methods were tested on a set of planar problems. Mathematical programming formulations are proposed for the discrete problem, and a solution approach is suggested and tested. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Location
Heuristics
Cover
Planar
Network
Discrete
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations