Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (7): 1655-1660.

Previous Articles     Next Articles

Study of the multi-ground stations scheduling problem with the characteristic of flexible priority

CHEN Hao, LI Jun, TANG Yu, JING Ning   

  1. School of Electronics Science and Engineering, National Univ. of Defense Technology, Changsha 410073, China
  • Received:2008-04-28 Revised:2008-09-17 Online:2009-07-20 Published:2010-01-03

Abstract: The multi-ground stations scheduling problem is a complex combinatorial optimization problem.Current researches mainly deal with this problem on the assumption that the data-download missions have no priority or fixed priority.With the characteristic of flexible priority of data-download missions,the conflict section constraint graph model is established and an algorithm based on genetic algorithm is proposed.Finally,some experiments are implemented to valid the correctness and practicability of the proposed algorithm.

CLC Number: 

[an error occurred while processing this directive]