An Adaptive Genetic Algorithm for Solving Ground-Space TT&C Resources Integrated Scheduling Problem of Beidou Constellation

被引：0

作者：

Zhang Tianjiao ^{[1
,2
]}

Li Zexi ^{[2
]}

Li Jing ^{[1
]}

机构：

[1] State Key Lab Astronaut Dynam, Xian 710043, Shannxi, Peoples R China

[2] Xi An Jiao Tong Univ, Dept Elect & Engn, Xian 710049, Shannxi, Peoples R China

来源：

2014 IEEE CHINESE GUIDANCE, NAVIGATION AND CONTROL CONFERENCE (CGNCC) | 2014年

关键词：

TT&C; Beidou MEO constellation; Ground-space Integrated Scheduling; Adaptive Genetic Algorithm;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Space-based TT&C technology is an effective way to solve the problem of resources dissatisfaction of ground-based TT&C system. When solving the Beidou MEO constellation optimization scheduling problem, traditional genetic algorithm(GA) has the disadvantages of premature and low speed convergence. This paper designs a self-adjust based GA which adds an evolution probability principle which depends on population diversity, population fitness and population generation number. Meanwhile, when to select new population, it adopts refine management and elite preservation strategy of divisional sampling so as to enhance the search performance of GA. The experimental result demonstrates the validity of the new algorithm. Compared with the traditional GA, the new algorithm increases the schedule completion rate and weighted task completion rate by 11% and 11.1% respectively.

引用

页码：1785 / 1792

页数：8