具有任务合并的EOS调度问题的模拟退火算法

Proceedings of 2011 International Conference on Modelling, Identification and Control Pub Date : 2011-06-26 DOI:10.1109/ICMIC.2011.5973764

G. Peng, Li Wen, Yao Feng, Bai Baocun, Yang Jing

{"title":"具有任务合并的EOS调度问题的模拟退火算法","authors":"G. Peng, Li Wen, Yao Feng, Bai Baocun, Yang Jing","doi":"10.1109/ICMIC.2011.5973764","DOIUrl":null,"url":null,"abstract":"The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.","PeriodicalId":210380,"journal":{"name":"Proceedings of 2011 International Conference on Modelling, Identification and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Simulated annealing algorithm for EOS scheduling problem with task merging\",\"authors\":\"G. Peng, Li Wen, Yao Feng, Bai Baocun, Yang Jing\",\"doi\":\"10.1109/ICMIC.2011.5973764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.\",\"PeriodicalId\":210380,\"journal\":{\"name\":\"Proceedings of 2011 International Conference on Modelling, Identification and Control\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2011 International Conference on Modelling, Identification and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMIC.2011.5973764\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2011 International Conference on Modelling, Identification and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMIC.2011.5973764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

对地观测卫星的回转操作受到严格约束，采用任务合并的观测调度可以提高卫星的观测效率。本文提出了具有任务合并的卫星观测调度问题模型，并提出了一种快速模拟退火算法(VFSA)来求解该问题。VFSA算法采用组合邻域和分解邻域进行动态任务合并。为了避免局部最优解，提高勘探能力，在VFSA中定义了再退火和扰动、重排、重启三种分散策略。实验结果表明了该方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Simulated annealing algorithm for EOS scheduling problem with task merging

The slew operations of earth observation satellites are tightly constrained, observation scheduling with task merging can improve satellites observing efficiency. The model of satellite observation scheduling problem with task merging is proposed in this paper article and a Very Fast Simulated Annealing algorithm (VFSA) is developed to solve the problem. The VFSA algorithm employs compose and decompose neighborhoods for dynamic task merging. To avoid the local optimum solutions and improve the exploration abilities, re-annealing and three diversification strategies, perturb, rearrange and restart are defined in VFSA. Experiments results show the effectiveness of our approach.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 2011 International Conference on Modelling, Identification and Control

自引率

0.00%

发文量