带预估选择的Memetic算法求解多星测控资源调度问题

张雁; 党群; 黄永宣

您当前的位置：

首页 >

文章列表页 >

带预估选择的Memetic算法求解多星测控资源调度问题

更新时间：2025-07-09

- 带预估选择的Memetic算法求解多星测控资源调度问题
- A Memetic Algorithm with Predictive Selection for Multi-Satellite TT&C Resources Scheduling Problems
- 西安交通大学学报 2009年43卷第10期页码：37-41
- 作者机构：
  
  西安交通大学系统工程研究所,西安,710049
- 作者简介：
- 基金信息：
  
  : 2009-04-02. 作者简介: 张雁(1979-),女,博士生;黄永宣(联系人),男,教授,博士生导师. 基金项目: 国家自然科学基金资助项目(60875043)
- DOI：
  中图分类号： TP391.9
- 网络首发：2009-10-10，
  
  纸质出版：2009
- 稿件说明：
移动端阅览
张雁, 党群, 黄永宣. 带预估选择的Memetic算法求解多星测控资源调度问题[J]. 西安交通大学学报, 2009,43(10):37-41.

A Memetic Algorithm with Predictive Selection for Multi-Satellite TT&C Resources Scheduling Problems[J]. 2009, 43(10): 37-41.
张雁, 党群, 黄永宣. 带预估选择的Memetic算法求解多星测控资源调度问题[J]. 西安交通大学学报, 2009,43(10):37-41. DOI：

A Memetic Algorithm with Predictive Selection for Multi-Satellite TT&C Resources Scheduling Problems[J]. 2009, 43(10): 37-41. DOI：

摘要

针对当前多星航天测控资源调度系统模型描述复杂、求解算法不适合大型算例的问题

利用系统约束条件的二元化特点建立了多星测控资源调度系统在一类特殊图上的最大独立集模型

进而针对该模型解空间结构多峰密布、欺骗性强的问题

提出了一种带预估选择机制的改进型Memetic算法.在分析交叉操作可达域的基础上

设计了一种能快速预估交叉操作最大收益的预估算子

通过预估运算

每个个体从几个待选交叉对象中可选择出最有利的一个对象

以在有希望区域间实现搜索的转移.大型Benchmark算例上的仿真结果表明

所提预估选择机制能减弱原模型欺骗性的影响

使Memetic算法的性能平均提高了17%.

Abstract

Focusing on the problems that the model description of the multi-satellite spacecraft tracking

telemetry and command(TT&C)resources scheduling systems are commonly complicated and that the existing solution algorithms are usually not appropriate to large scale instances

the multi-satellite TT&C resources scheduling system is converted into a maximum independent set(MIS)problem in a special class of graphs by exploiting the binary-structure of the system constraints. Then a new Memetic algorithm with predictive selection is proposed to solve the strong deceptive problem that comes from highly multi-peak distributed structure of the MIS. An efficient and fast predictive operator is designed based on the analysis of the reachable domains. The operator can predict the maximum accessible profit of the crossover operation with different objects

and selects the best crossover object from several candidate ones

thereby searches for promising solutions. Simulation results on large scale benchmark graphs show that

the predictive selection strategy reduces effects of the deceptive problem and that the performance of Memetic algorithm is improved at an average of 17%.

关键词

Keywords

references

王远振, 赵坚, 聂成. 多卫星-地面站系统的Petri网模型研究 [J]. 空军工程大学学报(自然科学版), 2003, 4(2): 7-11.

WANG Yuanzhen, ZHAO Jian, NIE Cheng. Study on Petri net model for multi-satellites ground station system [J]. Journal of Air Force Engineering University(Natural Science Edition), 2003, 4(2): 7-11.

金光. 卫星地面站测控资源调度CSP模型 [J]. 系统工程与电子技术, 2007, 29(7): 1117-1120.

JIN Guang. CSP model for satellite and ground station TTC resource scheduling problems [J]. Systems Engineering and Electronics, 2007, 29(7): 1117-1120.

陈英武, 方炎申, 李菊芳, 等. 卫星任务调度问题的约束规划模型 [J]. 国防科技大学学报, 2006, 28(5): 126-132.

CHEN Yingwu, FANG Yanshen, LI Jufang, et al. Constraint programming model of satellite mission scheduling [J]. Journal of National University of Defense Technology, 2006, 28(5): 126-132.

杨永安, 樊恒海, 冯祖仁, 等. 一种基于ES法的卫星测控资源调度仿真及实现 [J]. 系统仿真学报, 2005, 17(4): 982-985.

YANG Yongan, FAN Henghai, FENG Zuren, et al. Simulation realization of satellite TTC resources scheduling based on event scheduling method [J]. Journal of System Simulation, 2005, 17(4): 982-985.

WU Bin, LI Yuanxin, HUANG Yongxuan. Optimal scheduling of TTC network resources based on genetic algorithm [J]. Journal of Astronautics, 2006, 27(6): 1132-1136.

BARBULESCU L, WATSON J P, WHITLEY L D, et al. Scheduling space-ground communications for the air force satellite control network[J]. Journal of Scheduling, 2004, 7(1): 7-34.

邢立宁, 陈英武. 基于混合蚁群优化的卫星地面站系统任务调度方法 [J]. 自动化学报, 2008, 34(4): 414-418.

XING Lining, CHEN Yingwu. Mission planning of satellite ground station system based on the hybrid ant colony optimization[J]. Acta Automatica Sinica, 2008, 34(4): 414-418.

ALEKSEEV V E, LOZIN V V. Independent sets of maximum weight in(p, q)-colorable graphs [J]. Rutcor Research Report, 2003, 265(1/3): 351-356.

PULLAN W. Phased local search for the maximum clique problem [J]. Journal of Combinatorial Optimization, 2006, 12(3): 303-323.

DIESTEL R. Graph theory[M]. Berlin, Germany: Springer, 2005.

CORMEN T H. Introduction to algorithms [M]. Cambridge, Massachusetts, USA: MIT Press, 2001.

高强, 吕文芝, 杜小山, 等. 遗传算法优化性能评价准则研究 [J]. 西安交通大学学报, 2006, 40(7): 803-806.

GAO Qiang, LU Wenzhi, DU Xiaoshan, et al. Evaluation for genetic algorithm performance [J]. Journal of Xi'an Jiaotong University, 2006, 40(7): 803-806.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

面向多目标探测的无线传感器网络资源调度方法

高动态测量系统中的自适应信号成形滤波器设计

电动车辆间接热系统快速除湿响应迟滞机理及优化控制策略

扇贝仿生密封腔室内超临界二氧化碳泄漏流湍动能耗散机理研究

离子液体改性燃料的电流体动力学效应研究