Skip to main content

Solving Satellite Range Scheduling Problem with Learning-Based Artificial Bee Colony Algorithm

  • Conference paper
  • First Online:
Bio-Inspired Computing: Theories and Applications (BIC-TA 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1565))

Abstract

Satellite range scheduling problem (SRSP) is a critical and challenging scheduling problem due to the oversubscribed and sequence dependency characteristics. The artificial bee colony algorithm (ABC) is one of the popular evolutionary algorithms to solve large-scale scheduling problems. A new artificial bee colony algorithm is proposed, named the learning-based artificial bee colony algorithm (LB-ABC). We proposed two new learning strategies, named error-based learning strategy and position-based learning strategy, to improve traditional ABC's exploration and exploitation performance. Error-based learning strategy uses differences of each individual in the population to improve the population structure. Position-based learning strategy through the experience of scheduling tasks guide the generation process of new bees. Experiments and algorithm analysis show that the learning strategy we proposed is of great help to planning tasks, and the performance of the new algorithm is better than state-of-the-art algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.ibm.com/products/ilog-cplex-optimization-studio.

References

  1. Vazquez, A.J., Erwin, R.S.: On the tractability of satellite range scheduling. Optim. Lett. 9(2), 311–327 (2014). https://doi.org/10.1007/s11590-014-0744-8

    Article  MathSciNet  MATH  Google Scholar 

  2. Gooley, T.D.: Automating the satellite range scheduling process, Master’s Thesis Air Force Institute of Technology (1993)

    Google Scholar 

  3. He, L., Weerdt, M.D., Smith, N.Y.: Tabu-based large neighbourhood search for time/sequence-dependent scheduling problems with time windows. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019) (2019)

    Google Scholar 

  4. Du, Y.H., Xing, L.N., et al.: MOEA based memetic algorithms for multi-objective satellite range scheduling problem. Swarm Evol. Comput. 50, 100576 (2019)

    Article  Google Scholar 

  5. Barbulescu, L., Howe, A.E., Roberts, M., Whitley, L.D.: Understanding algorithm performance on an oversubscribed scheduling application. J. Artif. Intell. Res. 27(12), 577–615 (2006)

    Article  Google Scholar 

  6. Bahriye, A., Dervis, K.: A modified artificial bee colony algorithm for real-parameter optimization. Inf. Sci. 192(1), 120–142 (2012)

    MATH  Google Scholar 

  7. Song, X.Y., Zhao, M., Xing, S.Y.: A multi-strategy fusion artificial bee colony algorithm with small population. Expert Syst. Appl. 142, 112921 (2020)

    Article  Google Scholar 

  8. Gao, H., Shi, Y., Pun, C.M., Kwong, S.: An improved artificial bee colony algorithm with its application. IEEE Trans. Ind. Inf. 15(4), 1853–1865 (2019)

    Article  Google Scholar 

  9. Mustafa, S., Kiran, H., et al.: Artificial bee colony algorithm with variable search strategy for continuous optimization. Inf. Sci. 300, 140–157 (2015)

    Article  MathSciNet  Google Scholar 

  10. Karaboga, D., Kaya, E.: An adaptive and hybrid artificial bee colony algorithm (aabc) for ANFIS training. Appl. Soft Comput. 49, 423–436 (2016)

    Article  Google Scholar 

  11. Barbulescu, L., Howe, A., Whitley, D.: Afscn scheduling: how the problem and solution have evolved. Math. Comput. Model. 43(9–10), 1023–1037 (2006)

    Article  MathSciNet  Google Scholar 

  12. Xhafa, F., Herrero, X., Barolli, A., Barolli, L., Takizawa, M.: Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem. J. Comput. Syst. Sci. 79(7), 1086–1100 (2013)

    Article  MathSciNet  Google Scholar 

  13. Xhafa, F., Herrero, X., Barolli, A., Takizawa, M.: A simulated annealing algorithm for ground station scheduling problem. In: International Conference on Network-based Information Systems. IEEE Computer Society (2013)

    Google Scholar 

  14. Xhafa, F, Herrero, X, Barolli, A., Takizawa, M.: A tabu search algorithm for ground station scheduling problem. In: IEEE International Conference on Advanced Information Networking & Applications. IEEE (2014)

    Google Scholar 

  15. Luo, K., Wang, H., Li, Y., Li, Q.: High-performance technique for satellite range scheduling. Comput. Oper. Res. 85, 12–21 (2017)

    Article  MathSciNet  Google Scholar 

  16. Song, Y.J., Xing, L.N., et al.: A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem. Comput. Ind. Eng. 150, 106830 (2020)

    Article  Google Scholar 

  17. Chen, Y., Song, Y., Du, Y., Wang, M., Zong, R., Gong, C.: A knowledge-based scheduling method for multi-satellite range system. In: Li, G., Shen, H.T., Yuan, Y., Wang, X., Liu, H., Zhao, X. (eds.) KSEM 2020. LNCS (LNAI), vol. 12274, pp. 388–396. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-55130-8_34

    Chapter  Google Scholar 

  18. Song, B., Chen, Y., Yao, F., et al.: A hybrid genetic algorithm for satellite image downlink scheduling problem. Disc. Dyn. Nat. Soc. 2018, 1–11 (2018)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

This work was supported by the National Natural Science Foundation of China under Grant 71901213 and 72001212.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanjie Song .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Song, Y., Wei, L., Xing, L., Fang, Y., Zhang, Z., Chen, Y. (2022). Solving Satellite Range Scheduling Problem with Learning-Based Artificial Bee Colony Algorithm. In: Pan, L., Cui, Z., Cai, J., Li, L. (eds) Bio-Inspired Computing: Theories and Applications. BIC-TA 2021. Communications in Computer and Information Science, vol 1565. Springer, Singapore. https://doi.org/10.1007/978-981-19-1256-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-1256-6_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-1255-9

  • Online ISBN: 978-981-19-1256-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics