Title
Evolutionary Algorithms for Many-Objective Ground Station Scheduling Problem.
Abstract
The task planning of satellite-ground time synchronization (SGTSTP) is a complex many-objective ground station scheduling problem. In this paper, we first provide a mathematical formulation of SGTSTP. To solve this problem, we propose a decomposition-and-integration (DI) based method. In DI method, the plan horizon is evenly divided into many disjoint plan periods and all time windows are distributed to each period, based on which the task planning problem turns into a multi-period 0-1 programming problem. Then we embed DI method into evolutionary algorithm framework and propose DI based evolutionary many-objective algorithm (DI-EMOA). At last, the computational results show that the DI-EMOAs have obvious performance promotion compared with heuristic algorithm.
Year
Venue
Field
2016
BIC-TA
Memetic algorithm,Mathematical optimization,Job shop scheduling,Disjoint sets,Evolutionary algorithm,Scheduling (computing),Heuristic (computer science),Computer science,Rate-monotonic scheduling,Ground station
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Zhongshan Zhang100.34
Lining Xing2168.51
Yuning Chen300.34
Pei Wang400.34