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

doi:10.3873/j.issn.1000-1328.2012.01.012

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

School of Aerospace Engineering

Harbin Institute of Technology

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	85-90
Number of pages	6
Journal	Yuhang Xuebao/Journal of Astronautics
Volume	33
Issue number	1
DOIs	https://doi.org/10.3873/j.issn.1000-1328.2012.01.012
Publication status	Published - Jan 2012

Keywords

Genetic algorithm
Planning and scheduling
Priority
Range scheduling
TT&C

Access to Document

10.3873/j.issn.1000-1328.2012.01.012

Cite this

Li, Y. Q., Wang, R. X., Xu, M. Q., Cui, H. T., Wang, H. B., & Xu, R. (2012). An improved genetic algorithm for a class of multi-resource range scheduling problem. Yuhang Xuebao/Journal of Astronautics, 33(1), 85-90. https://doi.org/10.3873/j.issn.1000-1328.2012.01.012

@article{b68eb5fad7e74d42b328e5bda28ce301,

title = "An improved genetic algorithm for a class of multi-resource range scheduling problem",

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.",

keywords = "Genetic algorithm, Planning and scheduling, Priority, Range scheduling, TT&C",

author = "Li, {Yu Qing} and Wang, {Ri Xin} and Xu, {Min Qiang} and Cui, {Hu Tao} and Wang, {Hai Bo} and Rui Xu",

year = "2012",

month = jan,

doi = "10.3873/j.issn.1000-1328.2012.01.012",

language = "English",

volume = "33",

pages = "85--90",

journal = "Yuhang Xuebao/Journal of Astronautics",

issn = "1000-1328",

publisher = "Chinese Society of Astronautics",

number = "1",

}

TY - JOUR

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

AU - Li, Yu Qing

AU - Wang, Ri Xin

AU - Xu, Min Qiang

AU - Cui, Hu Tao

AU - Wang, Hai Bo

AU - Xu, Rui

PY - 2012/1

Y1 - 2012/1

N2 - 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.

AB - 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.

KW - Genetic algorithm

KW - Planning and scheduling

KW - Priority

KW - Range scheduling

KW - TT&C

UR - http://www.scopus.com/inward/record.url?scp=84863077737&partnerID=8YFLogxK

U2 - 10.3873/j.issn.1000-1328.2012.01.012

DO - 10.3873/j.issn.1000-1328.2012.01.012

M3 - Article

AN - SCOPUS:84863077737

SN - 1000-1328

VL - 33

SP - 85

EP - 90

JO - Yuhang Xuebao/Journal of Astronautics

JF - Yuhang Xuebao/Journal of Astronautics

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this