Solving the selecting and scheduling satellite photographs problem with a consistent neighborhood heuristic
Solving the selecting and scheduling satellite photographs problem with a consistent neighborhood heuristic
复制标题
DOI：
10.1109/ictai.2004.110
复制
发表时间：
2004-11
期刊：
影响因子：
--
通讯作者：
Djamal Habet;Michel Vasquez
中科院分区：
文献类型：
--
作者：
Djamal Habet;Michel Vasquez
管理敏捷地球观测卫星的问题包括选择和调度的一个子集的照片，在一组候选人，满足强制约束和最大化的增益函数。本文提出了一种禁忌搜索算法来解决敏捷对地观测卫星的管理问题。该算法是一个适应的CN禁忌方法工作在一个一致的邻域。事实上，为了获得广泛和有效的探索，搜索空间被一致和饱和的配置采样。通过约束传播保持一致性，饱和度是最优解的一个特征。此外，我们的禁忌算法与系统搜索杂交，使用部分枚举，解决几个决策问题。此外，为了更好的分辨率，第二个目标的问题，最小化的两个图像采集之间的过渡持续时间的总和，引入和处理与第二禁忌搜索算法。
The problem of managing an Agile Earth Observing Satellite consists of selecting and scheduling a subset of photographs, among a set of candidate ones, satisfying imperative constraints and maximizing a gain function. In this paper, we propose a tabu search algorithm to solve the management problem of an Agile Earth Observing Satellite. This algorithm is an adaptation of CN-Tabu methodology working on a consistent neighborhood. Indeed, to obtain a wide-ranging and efficient exploration, the search space is sampled by consistent and saturated configurations. The consistency is maintained by constraint propagation and the saturation is a feature of the optimal solution. Furthermore, our tabu algorithm is hybridized with a systematic search, using partial enumerations, to solve several decisional problems. Moreover, for better resolution, a second objective problem, the minimization of the sum of transition durations between two image acquisitions, is introduced and tackled with a second tabu search algorithm.