首页> 外文会议>Intelligent Information Technology Application, 2009. IITA 2009 >Simulation Based Multi-objective Extremal Optimization Algorithm for Electronic Reconnaissance Satellites Scheduling Problem
【24h】

Simulation Based Multi-objective Extremal Optimization Algorithm for Electronic Reconnaissance Satellites Scheduling Problem

机译:电子侦察卫星调度问题的基于仿真的多目标极值优化算法

获取原文

摘要

A multi-objective chance constrained programming model(MOCCPM) for electronic reconnaissance satellites scheduling problem(ERSSP) is presented. MOCCPM takes the uncertainties in the course of satellite electronic reconnaissance into account, as well as the capabilities and usage restrictions of the electronic reconnaissance satellites. Then a Monte Carlo simulation based multi-objective extremal optimization (MCSBMOEO) algorithm is proposed. Penalty function based fitness assignment ensures the efficient evolution. Problem specific mutation operator ensures the feasibility of the offspring so as to prevent the algorithm from falling into local optimum. External archive is to keep the non-dominated solutions and guarantee their diversity. Monte Carlo sampling is to address the stochastic nature of ERSSP. The experiment results testified that the algorithm can solve ERSSP effectively.
机译:提出了一种用于电子侦察卫星调度问题(ERSSP)的多目标机会约束规划模型(MOCCPM)。 MOCCPM考虑了卫星电子侦察过程中的不确定性,以及电子侦察卫星的能力和使用限制。然后提出了一种基于蒙特卡罗模拟的多目标极值优化算法。基于罚分功能的适应度分配可确保高效进化。问题特定的变异算子确保后代的可行性,以防止算法陷入局部最优。外部存档是为了保留非主导解决方案并确保其多样性。蒙特卡洛采样是为了解决ERSSP的随机性。实验结果表明,该算法可以有效地解决ERSSP问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号