Coverage problem approach using multi-objective scheme

Authors:
German A. Sotelo;Steven J. Rigby;Yezid Donoso
Affiliations:
Department of System and Computer Engineering, University of the Andes, Bogotá, Colombia;Department of System and Computer Engineering, University of the Andes, Bogotá, Colombia;Department of System and Computer Engineering, University of the Andes, Bogotá, Colombia
Venue:
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Year:
2011

Citing 2
Cited 0

Coverage optimization in continuous space facility siting

International Journal of Geographical Information Science
Voronoi-based coverage optimization for mobile networks with limited sensing range: a directional search approach

ACC'09 Proceedings of the 2009 conference on American Control Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of coverage optimization has been proposed for a long time. In this group of difficulties, many settings have been confronted like placing facilities in order to increase the number of users that have access or placing antennas so that an area has a maximum availability or so that it is constantly monitored. In this paper we propose a generic solution for a group of these problems: placing elements so that the costs are minimized and the utility is maximized with the restriction of no redundancy (none of the radii can overlap). A genetic algorithm (using SPEA as a blueprint) was conceived and compared against the solver CPLEX solving a mixed integer quadratically constrained (MIQCP) problem. The results show that many scenarios can be resolved with the algorithm and gave superior results against the numeric solver.