Skip to main content

A Collaboration Services Scheduling Method Based on Intelligent Genetic Algorithm

  • Conference paper
  • First Online:
Computer Supported Cooperative Work and Social Computing (ChineseCSCW 2018)

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

  • 857 Accesses

Abstract

The optimization problem of collaboration services scheduling is a major bottleneck restricting the efficiency and cost of collaboration services executing. Correct and efficient handling of scheduling problems contributes to reducing costs and increase efficiency. The traditional GA solves this multi-objective problem more comprehensively than the random algorithm such as stochastic greedy algorithm, but it still has some one-sidedness compared with the actual situation. This paper enhances the flexibility and diversity of the algorithm on the basis of traditional genetic algorithm. In the process of initial population selection, it adopts the method of determining the preliminary internal point internal modification, and optimizes the selection process in the iteration as the selection method based on population exchange to achieve the choice. Mutation factors in the variation based on the individual’s innate quality of adaptive selection enhance the diversity of the population. In the experiments, this algorithm can not only maintain individual diversity, increase the probability of excellent individuals, speed up the convergence rate, but also will not lead to the ultimate result of the local optimal solution.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Cheng, Y., Bi, L., Tao, F., Ji, P.: Hypernetwork-based manufacturing service scheduling for distributed and collaborative manufacturing operations towards smart manufacturing. J. Intell. Manuf., 1–14 (2018)

    Google Scholar 

  2. Hvolby, H., Setger-Jensen, K.: Technical and industrial issues of advanced planning and scheduling (APS) systems. Comput. Ind. 61(9), 845–851 (2010)

    Article  Google Scholar 

  3. Shi, L., Fu, X., Li, J.: Mobility prediction-based service scheduling optimization algorithm in cloudlets. In: Proceedings of Cloud Computing and Security, Nanjing, China, pp. 619–630 (2017)

    Google Scholar 

  4. Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Trans. Evol. Comput. 6(4), 347–357 (2002)

    Article  Google Scholar 

  5. Stutzle, T., Hoos, H.: MAX-MIN ant system and local search for the traveling salesman problem. In: Proceedings of IEEE International Conference on Evolutionary Computation, Indianapolis, USA, pp. 309–314 (1997)

    Google Scholar 

  6. Xia, Y., Cheng, B., Chen, J., Cheng, B.: Optimizing services composition based on improved ant colony algorithm. Chin. J. Comput. 35(2), 270–281 (2012)

    Article  Google Scholar 

  7. Wang, J., Zhang, W., Zhang, J.: Cooperative differential evolution with multiple populations for multiobjective optimization. IEEE Trans. Cybern. 46(12), 2848–2861 (2015)

    Article  Google Scholar 

  8. Antonio, L., Coello, C.: Use of cooperative coevolution for solving large scale multiobjective optimization problems. In: Proceedings of IEEE Evolutionary Computation, Cancun, Mexico, pp. 2758–2765 (2013)

    Google Scholar 

  9. Li, S., Chen, Y., Du, H., Feldman, M.: A genetic algorithm with local search strategy for improved detection of community structure. Complexity 15(4), 53–60 (2010)

    MathSciNet  Google Scholar 

  10. Ide, J., Köbis, E., Kuroiwa, D.: The relationship between multi-objective robustness concepts and set-valued optimization. Fixed Point Theory Appl. 2014(1), 1–20 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgment

Research was supported by: (1) the National Key Technologies R&D Program No. 2016YFB1000602, No. 2017YFB1400102; (2) the National Natural Science Foundation of China under Grant, No. 61572295; (3) TaiShan Industrial Experts Programme of Shandong Province, No. tscy20160404.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lizhen Cui .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Guo, W., Xu, M., Xu, W., Cui, L. (2019). A Collaboration Services Scheduling Method Based on Intelligent Genetic Algorithm. In: Sun, Y., Lu, T., Xie, X., Gao, L., Fan, H. (eds) Computer Supported Cooperative Work and Social Computing. ChineseCSCW 2018. Communications in Computer and Information Science, vol 917. Springer, Singapore. https://doi.org/10.1007/978-981-13-3044-5_46

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-3044-5_46

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-3043-8

  • Online ISBN: 978-981-13-3044-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics