计算机集成制造系统 ›› 2013, Vol. 19 ›› Issue (09): 2213-2219.

• 产品创新开发技术 • 上一篇    下一篇

求解卫星任务调度问题的时间片蚁群算法

马跃飞,武小悦,邢立宁   

  1. 国防科学技术大学信息系统与管理学院管理系
  • 出版日期:2013-09-30 发布日期:2013-09-30
  • 基金资助:
    国家自然科学基金资助项目(71031007,71101150,71071156,61203180,71101013)。

Ant colony optimization with time pieces for satellites scheduling

  • Online:2013-09-30 Published:2013-09-30
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.71031007,71101150,71071156,61203180,71101013).

摘要: 为更好地求解卫星任务调度问题,提出一种时间片蚁群算法。在算法中引入任务时间片,使算法可分辨任务在不同时间窗内的执行情况;在任务分配中设计了带偏好的卫星片切割策略,改变了以往的任务分配搜索模式,极大地提高了算法的执行速度。相对于传统的蚁群算法和遗传算法,所提方法在求解卫星任务调度时具有较大优势。

关键词: 蚁群算法, 时间片, 卫星任务调度, 偏好, 切割策略

Abstract: To solve the satellites scheduling problem better,an ant colony optimization with time pieces was proposed.By introducing task time pieces,the algorithm was enable to distinguish tasks execution allocated to different time windows.The satellite time pieces cutting strategy with preference was designed to change the past search mode and significantly improve execution speed of the algorithm.The experimental results showed that the proposed algorithm outperformed the traditional ant colony optimization and genetic algorithm.

Key words: ant colony optimization, time pieces, satellite scheduling, preference, cutting strategy

中图分类号: