An iterated adaptive large neighborhood search algorithm for the large-scale communication satellite range scheduling problem
Abstract: Highlights•This study builds a mathematical model for the new communication satellite range scheduling problem.•An iterated adaptive large neighborhood search algorithm is proposed to solve this problem.•Neighborhood structures are constructed by considering the characteristics of the problem domain.•Two iterative mechanisms utilizing problem-specific knowledge are designed.•The proposed algorithm is tested through extensive experiments with different task scales.
Loading