Skip to main content
Springer Nature Link
Log in

Guidance-solution based ant colony optimization for satellite control resource scheduling problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

An ant colony optimization (ACO) approach for the satellite control resource scheduling problem is presented. Based on the observation that the solution space of the problem is sparse, this ACO approach is combined with a guidance solution based pheromone updating method to avoid trapping in local optima. The basic idea of this method is to change the distribution of pheromone trails by updating them with a guidance solution once the algorithm stagnates. We compare the proposed algorithm with several other heuristics. The experimental results demonstrate that our approach possesses strong competitive advantage in exploring global best solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Zweben M, Davis E, Daun B, Deale MJ (1993) Scheduling and rescheduling with iterative repair. IEEE Trans Syst Man Cybern 23(6):1588–1596

    Article  Google Scholar 

  2. Clement BJ, Johnston MD (2005) The deep space network scheduling problem. AAAI Press, Pittsburgh, pp 1514–1520

    Google Scholar 

  3. Barbulescu L et al (2004) Scheduling space-ground communications for the Air Force Satellite Control Network. J Sched 7(1): 7–34

    Article  Google Scholar 

  4. Barbulescu L, Whitley LD, Howe AE (2004) Leap before you look: An effective strategy in an oversubscribed scheduling problem. In: Proceedings of the 19th national conference on artificial intelligence, pp 143–148

  5. Kramer L, Barbulescu L, Smith S (2007) Understanding performance tradeoffs algorithms for solving oversubscribed scheduling. In: Proceedings of the 22nd national conference on artificial intelligence, pp 1019–1024

  6. Gratch J, Chien S (1996) Adaptive problem-solving for large-scale scheduling problem: A case study. J Artif Intell Res 4:365–396

    Google Scholar 

  7. Zhang Y, Yang F, Huang Y (2007) A novel selection-learning algorithm for multi-satellite scheduling problems. In: IEEE congress on evolutionary computation, pp 1318–1324

  8. Zhang N, Feng Z (2007) Cooperative ant colony optimization for multisatellite resource scheduling problem. In: IEEE congress on evolutionay computation, pp 2822–2828

  9. Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66

    Article  Google Scholar 

  10. Ke L, Archetti C, Feng Z (2008) Ant can solve the team orienteering problem. Comput Ind Eng 54(3):648–665

    Article  Google Scholar 

  11. Stützle T, Hoos HH (2000) MAX-MIN ant system. Future Gener Comput Syst 16(9):889–914

    Article  Google Scholar 

  12. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern, Part B 26(1):29–41

    Article  Google Scholar 

  13. Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6(4):333–346

    Article  Google Scholar 

  14. Wang G, Gong W, Derenzi B, Kastner R (2007) Ant colony optimizations for resource- and timing-constrained operation scheduling. IEEE Trans Comput-aided Des Integr Circuits Syst 26(6):1010–1029

    Article  Google Scholar 

  15. Andrew L, Jing L, Brian R, Fei X (2006) Ant colony optimization with hill climbing for the bandwidth minimization problem. Appl Soft Comput 6:180–188

    Article  Google Scholar 

  16. Blum C, Dorigo M (2004) The hyper-cube framework for ant colony optimization. IEEE Trans Syst Man Cybern Part B 34:1161–1172

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiaotong University, 710049, Xi’an, China

    Na Zhang, Zu-ren Feng & Liang-jun Ke

Authors
  1. Na Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zu-ren Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang-jun Ke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Na Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, N., Feng, Zr. & Ke, Lj. Guidance-solution based ant colony optimization for satellite control resource scheduling problem. Appl Intell 35, 436–444 (2011). https://doi.org/10.1007/s10489-010-0234-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-010-0234-3

Keywords