Abstract
One type of Multi-Resource Range Scheduling (MuRRS) problems featuring large scale input is researched in this paper, in which TT&C windows have priorities. First, the constraints in the problem are analyzed and the numerical model is established on the basis of former analysis. Second, aiming at characteristics of this problem, based on the genetic algorithm (GA), an improved genetic algorithm (IGA) is developed by designing the proper operators of copy cross and mutation. At last, a numerical computational example shows the validity of the approach.
Original language | English |
---|---|
Pages (from-to) | 85-90 |
Number of pages | 6 |
Journal | Yuhang Xuebao/Journal of Astronautics |
Volume | 33 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2012 |
Keywords
- Genetic algorithm
- Planning and scheduling
- Priority
- Range scheduling
- TT&C