期刊文献+

置换表示方法求解多卫星多地面站调度问题 被引量:1

On permutation-based integrated scheduling for earth observing system
在线阅读 下载PDF
导出
摘要 针对多卫星成像和多地面站数传并存的对地成像调度问题,从置换空间到调度解空间的映射方法和置换空间的搜索算法两方面进行了研究.提出了一种数传时间窗优先的置换序列映射算法,并证明该映射算法可以将置换序列映射到调度解空间上的最优解.提出了一种遗传随机搜索算法,基于有记忆随机邻域搜索,在置换空间上进行搜索.仿真计算表明,随机邻域搜索可以增强遗传算法的局部搜索能力,搜索结果平均获得了4.64%的改进. The integrated scheduling for earth observing system deals with multiple imaging satellites and ground stations simultaneously;it is a NP-hard oversubscribed scheduling problem involving lots of constraints.Permutationbased methods are presented to solve this complicated optimization problem.First,the integrated scheduling is expressed as permutation sequences,and a data-transfer-time-window preempted algorithm is put forward as the schedule builder,which ensures the searching for optimal schedules.Next,a genetic stochastic search method is designed to search for optimal permutations by using the permutation schedule builder and the stochastic neighborhood search algorithm with memory.Finally,the computational results on several scheduling instances show that our method enhances the local search ability for genetic search with an improvement-rate of 4.64%.
出处 《控制理论与应用》 EI CAS CSCD 北大核心 2010年第4期407-414,共8页 Control Theory & Applications
基金 国家自然科学基金资助项目(60604035) 国家863高技术研究发展项目(2007AA12Z229) 国家科技支撑计划课题(2006BAG01A07)
关键词 多卫星多地面站调度 置换表示 遗传算法 随机邻域搜索 integrated scheduling for earth observing system permutation genetic algorithm neighborhood search
  • 相关文献

参考文献12

  • 1GLOBUS A,CRAWFORD J,LOHN J,et al.A comparison of techniques for scheduling earth observing satellites[C] // Proceedings of the 16th Innovative Applications of Artificial Intelligence.San Jose,CA,USA:AAAI Press,2004:836-843.
  • 2BIANCHESSI N.Planning and scheduling problems for earth observation satellites:Models and algorithms[D].Milan,Italy:University of Milan,2006.
  • 3李菊芳.航天侦察多星多地面站任务规划问题研究[D].长沙:国防科学技术大学,2004.
  • 4SOMA P,VENKATESWARLU S,SANTHALAKSHMI S,et al.Multi-satellite scheduling using genetic algorithms[C] //Proceedings of the 8th International Conference on Space Operations.Motreal,Canada:[s.n.],2004.
  • 5MARINELLIF,NOCELLA S,ROSSI F,et al.A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints[R].Italy:Universit'a di L' Aquila,2005.
  • 6BARBULESCU L,HOWE A,WHITLEY D.AFSCN scheduling:how the problem and solution have evolved[J].Mathematical and Computer Modelling,2006,43(9/10):1023-1037.
  • 7KRAMER L,BARBULESCU L,SMITH S.Analyzing basic representation choices in oversubscribed scheduling problems[C] //Proceedings of the 3rd Multidisciplinary International Conference on Scheduling:Theory and Application.Paris,France:[s.n.],2007.
  • 8ERGUN O,ORLIN J B.Fast neighborhood search for the single machine total weighted tardiness problem[J].Operations Research Letters,2006,34(1):41-45.
  • 9WOFFE W J,SORENSEN S E.Three scheduling algorithms applied to the earth observing systems domain[J].Management Science,2000,46(1):148-166.
  • 10孙元凯,刘民,吴澄.变邻域结构Tabu搜索算法及其在Job Shop调度问题上的应用[J].电子学报,2001,29(5):622-625. 被引量:9

二级参考文献5

  • 1[1]Eugeniusz Nowichi & Czeslaw Smutnichi.A fast taboo search algorithm for the Job shop problem [J].Management Science,1996,42(6):797-813.
  • 2[2]Van Laarhoven P.J.M.,E.H.L.Aarts,and J.K.Lenstra.Job shop scheduling by simulated annealing [J].operations Research,1992,40(1):113-125.
  • 3[3]Adams J.,E.Balas,and D.Zawark.The shifting bottleneck procedure for job shop scheduling [J].Management Science,1988,34(3):391-401.
  • 4[4]Peter Bruker.Scheduling Algorithm [M].Springer-Verlay Berlin,Heidelberg,1998(2nd).
  • 5[5]Carlier J.And E.Pinson.An algorithm for solving the job-shop problem [J].Management Sci.,1989,35(2):164-176.

共引文献10

同被引文献3

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部