Adaptive variable neighborhood search algorithm with Metropolis rule and tabu list for satellite range scheduling problem

Abstract

Efficient scheduling of measurement and control resources plays a critical role in successful satellite operations. The tremendous growth in the number of satellites in orbit exacerbates resource scarcity, further enhancing the significance of the satellite range scheduling problem (SRSP). In order to maximize the benefits of measurement and control tasks, we propose an innovative algorithm to solve the SRSP with numerous constraints. Firstly, the SRSP operation flow is analyzed to establish a constraint satisfaction model. A task-resource matching algorithm based on fitness is then designed to generate an initial feasible solution with superior quality by heuristic criteria. Subsequently, an adaptive variable neighborhood search algorithm with Metropolis rule and tabu list (AVNS-MT) is proposed to solve the mathematical model. Three swap neighborhood structures are constructed to explore the solution space efficiently during the variable neighborhood descent search process. Meanwhile, three migration neighborhood structures are devised to enable the shaking of solutions and evasion from the local optimum. Moreover, the incorporation of the Metropolis rule and tabu search strategy will contribute to enhancing the algorithm convergence. Finally, we have conducted extensive simulations to verify the effectiveness and efficiency of the proposed AVNS-MT. Comparison experiments with several state-of-the-art methods validate the superiority of the proposed algorithm.