论文标题
卫星图像数据下行链路调度问题与家庭属性：模型和算法
Satellite image data downlink scheduling problem with family attribute: Model &Algorithm
论文作者
论文摘要
观察能力和过渡能力之间的异步发展导致一个由一次性观察形成的原始图像数据（OID）不能以EOS和GS之间的一次传输机会（称为可见的时间窗口，VTW）完全传输。它需要将OID分割为几个分段的图像数据（SID），然后将它们传输到几个VTW中，从而丰富了卫星图像数据下行链路调度问题（SIDSP）的扩展。我们将新颖的SIDSP定义为具有家庭属性（SIDSPWFA）的卫星图像数据下行调度问题，其中首先将快速分割操作员分割了一些大的OID，并且在第二步中传输了所有SID和其他无分段的OID。然后设计两个优化目标，即图像数据传输失败率（FR）和分割时间（ST），以形式化SIDSPWFA为BI-OXTIVE SIDSPWFA。此外，开发了一个双级进化算法（DE+NSGA-II），该算法是持有几个双阶段运算符的。广泛的仿真实例表明，详细分析了模型，策略，算法和操作员的效率。
The asynchronous development between the observation capability and the transition capability results in that an original image data (OID) formed by one-time observation cannot be completely transmitted in one transmit chance between the EOS and GS (named as a visible time window, VTW). It needs to segment the OID to several segmented image data (SID) and then transmits them in several VTWs, which enriches the extension of satellite image data downlink scheduling problem (SIDSP). We define the novel SIDSP as satellite image data downlink scheduling problem with family attribute (SIDSPWFA), in which some big OID is segmented by a fast segmentation operator first, and all SID and other no-segmented OID is transmitted in the second step. Two optimization objectives, the image data transmission failure rate (FR) and the segmentation times (ST), are then designed to formalize SIDSPWFA as a bi-objective discrete optimization model. Furthermore, a bi-stage differential evolutionary algorithm(DE+NSGA-II) is developed holding several bi-stage operators. Extensive simulation instances show the efficiency of models, strategies, algorithms and operators is analyzed in detail.
