An improved genetic algorithm for a class of multi-resource range scheduling problem

Yu Qing Li*, Ri Xin Wang, Min Qiang Xu, Hu Tao Cui, Hai Bo Wang, Rui Xu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)

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 languageEnglish
Pages (from-to)85-90
Number of pages6
JournalYuhang Xuebao/Journal of Astronautics
Volume33
Issue number1
DOIs
Publication statusPublished - Jan 2012

Keywords

  • Genetic algorithm
  • Planning and scheduling
  • Priority
  • Range scheduling
  • TT&C

Fingerprint

Dive into the research topics of 'An improved genetic algorithm for a class of multi-resource range scheduling problem'. Together they form a unique fingerprint.

Cite this