Learnable ant colony optimization algorithm for solving satellite ground station scheduling problems

被引:0
|
作者
Yao, Feng [1 ]
Xing, Li-Ning [1 ]
机构
[1] College of Information System and Management, National University of Defense Technology
来源
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2012年 / 34卷 / 11期
关键词
Ant colony optimization; Knowledge; Satellite ground station; Scheduling;
D O I
10.3969/j.issn.1001-506X.2012.11.14
中图分类号
学科分类号
摘要
With the increased observing requirements, more and more satellites and ground stations are joined to the earth observing system. It is urgent to effectively allocate the satellite ground station resources using some scientific techniques. Aiming to the satellite ground station scheduling problem, a learnable ant colony optimization (LACO) algorithm is proposed. Experimental results show that LACO is a viable and effective approach for the satellite ground station scheduling problem. This approach legitimately combines the ant colony optimization model with the knowledge model, which largely pursues the integrating advantages of these models. The proposed approach provides a useful reference to the improvement of existing optimization approaches.
引用
收藏
页码:2270 / 2274
页数:4
相关论文
共 22 条
  • [11] Xing L.N., Chen Y.W., Yang K.W., Double layer ant colony optimization for multi-objective flexible job shop scheduling problems, New Generation Computing, 26, 4, pp. 313-327, (2008)
  • [12] Xing L.N., Chen Y.W., Yang K.W., A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem, Engineering Applications of Artificial Intelligence, 21, 8, pp. 1370-1380, (2008)
  • [13] Xing L.N., Rohlfshagen P., Chen Y.W., Et al., An evolutionary approach to the multi-depot capacitated arc routing problem, IEEE Trans. on Evolutionary Computation, 14, 3, pp. 356-374, (2010)
  • [14] Ho N.B., Tay J.C., Lai E.M.K., An effective architecture for learning and evolving flexible job-shop schedules, European Journal of Operational Research, 179, 2, pp. 316-333, (2007)
  • [15] Chung C.J., Reynolds R.G., A testbed for solving optimization problems using cultural algorithm, Proc. of the Fifth Annual Conference on Evolutionary Programming, pp. 225-236, (1996)
  • [16] Branke J., Memory-enhanced evolutionary algorithms for dynamic optimization problems, Proc. of the Congress on Evolutionary Computation, pp. 1875-1882, (1999)
  • [17] Louis S.J., Mcdonnell J., Learning with case-injected genetic algorithms, IEEE Trans. on Evolutionary Computation, 8, 4, pp. 316-328, (2004)
  • [18] Michalski R.S., Learnable evolution model: evolution process guided by machine learning, Machine Learning, 38, 1, pp. 9-40, (2000)
  • [19] Wojtusiak J., The LEM3 system for multitype evolutionary optimization, Computing and Informatics, 28, 2, pp. 225-236, (2009)
  • [20] Reynolds R.G., An introduction to cultural algorithms, Proc. of the Third Annual Conference on Evolutionary Programming, pp. 131-139, (1994)