Planning Acquisitions for an Ocean Global Surveillance Mission.

In this paper, we present the problem of planning the acquisitions performed by a constellation of radar satellites in order to fulfil as well as possible an ocean global surveillance mission. Then, we describe the local search algorithm, inspired by large neighborhood search techniques and knapsack heuristics, that has been specifically designed and implemented to solve daily planning problem instances. We conclude with experiment reports and directions for further improvements.