期刊
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷 20, 期 2, 页码 137-157出版社
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1011203002719
关键词
tabu search; heuristics; satellite photograph scheduling; multidimensional knapsack; constrained combinatorial optimization
The daily photograph scheduling problem of earth observation satellites such as Spot 5 consists of scheduling a subset of mono or stereo photographs from a given set of candidates to different cameras. The scheduling must maximize a profit function while satisfying a large number of constraints. In this paper, we first present a formulation of the problem as a generalized version of the well-known knapsack model, which includes large numbers of binary and ternary logical constraints. We then develop a tabu search algorithm which integrates some important features including an efficient neighborhood, a dynamic tabu tenure mechanism, techniques for constraint handling, intensification and diversification. Extensive experiments on a set of large and realistic benchmark instances show the effectiveness of this approach.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据