Recent works raised the hypothesis that the assignment of a geometry to the decision variable space of a combinatorial problem could be useful both for providing meaningful descriptions of the fitness landscape and for supporting the systematic construction of evolutionary operators (the geometric operators) that make a consistent usage of the space geometric properties in the search for problem optima. This paper introduces some new geometric operators that constitute the realization of searches along the combinatorial space versions of the geometric entities descent directions and subspaces. The new geometric operators are stated in the specific context of the wireless sensor network dynamic coverage and connectivity problem (WSN-DCCP). A genetic algorithm (GA) is developed for the WSN-DCCP using the proposed operators, being compared with a formulation based on integer linear programming (ILP) which is solved with exact methods. That ILP formulation adopts a proxy objective function based on the minimi...
['Flávio V. C. Martins', 'Eduardo G. Carrano', 'Elizabeth F. Wanner', 'Ricardo H. C. Takahashi', 'Geraldo Robson Mateus', 'Fabíola Guerra Nakamura']
On a vector space representation in genetic algorithms for sensor scheduling in wireless sensor networks.