Matheuristic approaches for Q-coverage problem versions in wireless sensor networks

Alok Singh 1 André Rossi 2 Marc Sevaux 2
2 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : This article deals with sensor coverage scheduling in wireless sensor networks subject to Q-coverage constraints. The main concern is to maximize the network lifetime, while ensuring that each target is covered by a given number of sensors. Three different variations of this problem are considered. Column generation based exact approaches are developed for those problems where the auxiliary problem is solved by a two-level approach comprising a genetic algorithm and an integer linear programming formulation. The genetic algorithm takes advantage of the auxiliary problem structure and appears to be very efficient at providing the master problem with attractive columns. The auxiliary problem integer linear programming (ILP) formulation is then mostly used for proving the optimality status of the current master problem solution. The proposed approaches are shown to be significantly faster than column generation approaches relying only on the auxiliary problem ILP formulation.
Type de document :
Article dans une revue
Engineering Optimization, Taylor & Francis, 2013, 45 (5), pp.609-626. 〈10.1080/0305215X.2012.687732〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00757026
Contributeur : Marc Sevaux <>
Soumis le : lundi 26 novembre 2012 - 08:29:49
Dernière modification le : jeudi 11 janvier 2018 - 02:05:36

Identifiants

Citation

Alok Singh, André Rossi, Marc Sevaux. Matheuristic approaches for Q-coverage problem versions in wireless sensor networks. Engineering Optimization, Taylor & Francis, 2013, 45 (5), pp.609-626. 〈10.1080/0305215X.2012.687732〉. 〈hal-00757026〉

Partager

Métriques

Consultations de la notice

176