Fireworks algorithm for the multi-satellite control resource scheduling problem

In this study, fireworks algorithm (FWA) for the multi-satellite control resource scheduling problem (MSCRSP) is presented. FWA is a meta-heuristic method and widely used in continuous problems while MSCRSP is a constrained and large scale combinatorial problem. The key points of FWA are to define a suitable neighborhood structure for launching the local search procedure and to find a metric for quantifying the disparity between solutions. Three kinds of neighborhood structures are presented and the best fitted one is picked. Due to the speciality of this problem, each solution is transformed into a binary vector, and Hamming distance is adopted for defining disparity metric. The experimental results demonstrate the proposed FWA is more competitive than those commonly used methods.