Discrete cooperative covering problems |
| |
Authors: | O Berman Z Drezner D Krass |
| |
Institution: | 1.University of Toronto,Toronto,Canada;2.California State University-Fullerton,Fullerton,USA |
| |
Abstract: | A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two other problems that can be solved by the max-cover approach are the equivalents to set covering and p-centre problems. The problems are formulated, analysed and solved on networks. Optimal and heuristic algorithms are proposed and extensive computational experiments reported. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|