Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligent and Interactive Systems and Applications

IISA 2019: Advances in Intelligent Systems and Interactive Applications pp 325–332Cite as

Simulated Annealing in Talent Scheduling Problem

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1084))

Abstract

Talent Scheduling is about scheduling independent activities (such as scenes in a movie) to minimize the extra cost. Simulated annealing has played an important role in combinatorial optimization since it was proposed. This article explores how the simulated annealing algorithm is applied to solve the Talent Scheduling Problem and aims to generate a sequence as optimal as possible. We also discuss the influence of some factors on the performance of the proposed algorithm and give a suggestion about how SA can be improved.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

References

  1. Nordström, A.L., Tufekci, S.: A genetic algorithm for the talent scheduling problem. Comput. Oper. Res. 21(8), 927–940 (1994)

    Article  Google Scholar 

  2. Garcia de la Banda, M., Stuckey, P.J., Chu, G.: Solving talent scheduling with dynamic programming. INFORMS J. Comput. 23(1), 120–137 (2011)

    Article  MathSciNet  Google Scholar 

  3. Qin, H., Zhang, Z., Lim, A., et al.: An enhanced branch-and-bound algorithm for the talent scheduling problem. Eur. J. Oper. Res. 250(2), 412–426 (2016)

    Article  MathSciNet  Google Scholar 

  4. Cheng, T.C.E., Diamond, J.E., Lin, B.M.T.: Optimal scheduling in film production to minimize talent hold cost. J. Optim. Theory Appl. 79(3), 479–492 (1993)

    Article  MathSciNet  Google Scholar 

  5. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  6. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., et al.: Equation of state calculations by fast computing machines. The J. Chem. Phys. 21(6), 1087–1092 (1953)

    Article  Google Scholar 

  7. Rubenthaler, S., Rydén, T., Wiktorsson, M.: Fast simulated annealing in Rd with an application to maximum likelihood estimation in state-space models[J]. Stoch. Process. Appl. 119(6), 1912–1931 (2009)

    Article  Google Scholar 

  8. Fang, L., Chen, P., Liu, S.: Particle swarm optimization with simulated annealing for TSP. In: Proceedings of the 6th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED 2007), pp. 206–210 (2007)

    Google Scholar 

  9. Rere, L.M.R., Fanany, M.I., Arymurthy, A.M.: Simulated annealing algorithm for deep learning. Procedia Comput. Sci. 72, 137–144 (2015)

    Article  Google Scholar 

  10. Gu, X., Huang, M., Liang, X.: The improved simulated annealing genetic algorithm for flexible job-shop scheduling problem. In: 2017 6th International Conference on Computer Science and Network Technology (ICCSNT), pp. 22–27. IEEE (2017)

    Google Scholar 

  11. Ye, Z., Xiao, K., Ge, Y., et al.: Applying Simulated Annealing and Parallel Computing to the Mobile Sequential Recommendation. IEEE Trans. Knowl. Data Eng. 31(2), 243–256 (2019)

    Article  Google Scholar 

  12. De Vicente, J., Lanchares, J., Hermida, R.: Placement by thermodynamic simulated annealing. Phys. Lett. A 317(5–6), 415–423 (2003)

    Article  Google Scholar 

Download references

Acknowledgement

The work was financially supported by the National Key R&D Program of China (2017YFB1401300, 2017YFB1401302) and the self-determined research funds of CCNU from the colleges’ basic research and operation of MOE (Grant No. CCNU19ZN011).

Author information

Authors and Affiliations

  1. National Engineering Research Center for E-learning, Central China Normal University, Wuhan, 430079, China

    Cheng Chen, Dan Wang, Gongzhao Zhang & Mao Chen

Authors
  1. Cheng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gongzhao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mao Chen .

Editor information

Editors and Affiliations

  1. Dept De Ciències De La Computació, Universitat Politècnica De Catalunya, Barcelona, Spain

    Fatos Xhafa

  2. Department of Computer Science and Engineering, SOA University, Bhubaneswar, Odisha, India

    Srikanta Patnaik

  3. Department of Business Systems and Analytics, La Salle University, Philadelphia, PA, USA

    Madjid Tavana

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, C., Wang, D., Zhang, G., Chen, M. (2020). Simulated Annealing in Talent Scheduling Problem. In: Xhafa, F., Patnaik, S., Tavana, M. (eds) Advances in Intelligent Systems and Interactive Applications. IISA 2019. Advances in Intelligent Systems and Computing, vol 1084. Springer, Cham. https://doi.org/10.1007/978-3-030-34387-3_40

Download citation

Publish with us

Policies and ethics

Search

Navigation