Journal of Systems Engineering and Electronics ›› 2012, Vol. 34 ›› Issue (11): 2270-2274.doi: 10.3969/j.issn.1001-506X.2012.11.14

Previous Articles     Next Articles

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

YAO Feng, XING Li-ning   

  1. College of Information System and Management, National University of Defense Technology, Changsha 410073, China
  • Online:2012-11-20 Published:2010-01-03

Abstract:

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.

[an error occurred while processing this directive]