A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
RAIRO - Operations Research - Recherche Opérationnelle, Special ROADEF 2013, Tome 49 (2015) no. 1, pp. 99-121 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

Many optimization problems require the use of a local search to find a satisfying solution in a reasonable amount of time, even if the optimality is not guaranteed. Usually, local search algorithms operate in a search space which contains complete solutions (feasible or not) to the problem. In contrast, in Consistent Neighborhood Search (CNS), after each variable assignment, the conflicting variables are deleted to keep the partial solution feasible, and the search can stop when all the variables have a value. In this paper, we propose a generalized version of CNS, discuss its performance according to various criteria, and present successful adaptations of CNS to three types of satellite range scheduling problems. Such problems are motivated by applications encountered by the French National Space and Aeronautic Agencies and the US Air Force Satellite Control Network. The described numerical experiments will demonstrate that CNS is a powerful and flexible method, which can be easily combined with efficient ingredients.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2014027
Classification : 9008
Keywords: Metaheuristics, combinatorial optimization, satellite scheduling, consistent neighborhood search

Zufferey, Nicolas 1 ; Vasquez, Michel 2

1 Geneva School of Economics and Management, GSEM – University of Geneva, Uni-Mail, 1211 Geneva 4, Switzerland.
2 École des Mines d’Alès, LGI2P Research Center, Site EERIE, Parc scientifique Georges Besse, 30035 Nimes Cedex 01, France.
@article{RO_2015__49_1_99_0,
     author = {Zufferey, Nicolas and Vasquez, Michel},
     title = {A {Generalized} {Consistent} {Neighborhood} {Search} for {Satellite} {Range} {Scheduling} {Problems}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {99--121},
     year = {2015},
     publisher = {EDP-Sciences},
     volume = {49},
     number = {1},
     doi = {10.1051/ro/2014027},
     mrnumber = {3349119},
     zbl = {1310.90068},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014027/}
}
TY  - JOUR
AU  - Zufferey, Nicolas
AU  - Vasquez, Michel
TI  - A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2015
SP  - 99
EP  - 121
VL  - 49
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014027/
DO  - 10.1051/ro/2014027
LA  - en
ID  - RO_2015__49_1_99_0
ER  - 
%0 Journal Article
%A Zufferey, Nicolas
%A Vasquez, Michel
%T A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2015
%P 99-121
%V 49
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014027/
%R 10.1051/ro/2014027
%G en
%F RO_2015__49_1_99_0
Zufferey, Nicolas; Vasquez, Michel. A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems. RAIRO - Operations Research - Recherche Opérationnelle, Special ROADEF 2013, Tome 49 (2015) no. 1, pp. 99-121. doi: 10.1051/ro/2014027

Cité par Sources :