论文部分内容阅读
探讨了一类涉及多星、多地面站、多任务的卫星观测系统整体调度问题,该问题要求从过多赋权卫星观测需求中,选择有能力完成的一个任务子集,并为相应的拍照和数据下传活动安排资源和时间,以实现特定的优化目标.用一种变体形式的收发问题模型描述了该问题,并给出了其约束规划和禁忌搜索相结合的求解方法.最后用随机生成的问题示例检验了求解算法的性能.
This paper discusses the problem of global scheduling for a class of satellite observing systems involving multi-satellite, multi-ground stations and multi-tasking. This problem requires selecting a subset of tasks capable of fulfilling the requirement of over-empowered satellite observations, And data download activities to schedule resources and time to achieve specific optimization goals.The problem is described by a variant of the problem model of sending and receiving and its solution to the combination of constraint programming and tabu search is given.Finally, The sample of randomly generated problems tests the performance of the solution algorithm.