Skip to main content
SpringerLink
Log in

A New Learnheuristic: Binary SARSA - Sine Cosine Algorithm (BS-SCA)

  • Conference paper
  • First Online:
Metaheuristics and Nature Inspired Computing (META 2021)

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

Abstract

This paper proposes a novel learnheuristic called Binary SARSA - Sine Cosine Algorithm (BS-SCA) for solving combinatorial problems. The BS-SCA is a binary version of Sine Cosine Algorithm (SCA) using SARSA to select a binarization operator. This operator is required due SCA was created to work in continuous domains. The performance of BS-SCA is benchmarked with a Q-learning version of the learnheuristic. The problem tested was the Set Covering Problem and the results show the superiority of our proposal.

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

Access this chapter

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

Similar content being viewed by others

References

  1. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)

    Article  Google Scholar 

  2. Wolpert, D.H., Macready, W.G.: Coevolutionary free lunches. IEEE Trans. Evol. Comput. 9, 721–735 (2005)

    Article  Google Scholar 

  3. Voss, S., Maniezzo, V., Stützle, T.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming (Annals of Information Systems). Springer, Boston (2009). https://doi.org/10.1007/978-1-4419-1306-7

  4. Juan, A.A., Faulin, J., Grasman, S.E., Rabe, M., Figueira, G.: A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Oper. Res. Perspect. 2, 62–72 (2015)

    MathSciNet  Google Scholar 

  5. Talbi, E.-G.: Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann. Oper. Res. 240(1), 171–215 (2015). https://doi.org/10.1007/s10479-015-2034-y

    Article  MathSciNet  MATH  Google Scholar 

  6. Talbi, E.G.: Machine learning into metaheuristics: a survey and taxonomy of data-driven metaheuristics. (2020)

    Google Scholar 

  7. Song, H., Triguero, I., Özcan, E.: A review on the self and dual interactions between machine learning and optimisation. Prog. Artif. Intell. 8(2), 143–165 (2019). https://doi.org/10.1007/s13748-019-00185-z

    Article  Google Scholar 

  8. Calvet, L., de Armas, J., Masip, D., Juan, A.A.: Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Math. 15, 261–280 (2017)

    Article  MathSciNet  Google Scholar 

  9. Becerra-Rozas, M., et al.: Reinforcement learning based whale optimizer. In: Gervasi, O., et al. (eds.) ICCSA 2021. LNCS, vol. 12957, pp. 205–219. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-87013-3_16

    Chapter  Google Scholar 

  10. Cisternas-Caneo, F., et al.: A data-driven dynamic discretization framework to solve combinatorial problems using continuous metaheuristics. In: Abraham, A., Sasaki, H., Rios, R., Gandhi, N., Singh, U., Ma, K. (eds.) IBICA 2020. AISC, vol. 1372, pp. 76–85. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-73603-3_7

    Chapter  Google Scholar 

  11. García, J., et al.: A db-scan binarization algorithm applied to matrix covering problems. Comput. Intell. Neurosci. 2019, 1–16 (2019)

    Google Scholar 

  12. de León, A.D., Lalla-Ruiz, E., Melián-Batista, B., Moreno-Vega, J.M.: A machine learning-based system for berth scheduling at bulk terminals. Expert Syst. Appl. 87, 170–182 (2017)

    Article  Google Scholar 

  13. Tapia, D., et al.: Embedding q-learning in the selection of metaheuristic operators: the enhanced binary grey wolf optimizer case. In: 2021 IEEE International Conference on Automation/XXIV Congress of the Chilean Association of Automatic Control (ICA-ACCA), pp. 1–6 (2021)

    Google Scholar 

  14. Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8, 279–292 (1992)

    MATH  Google Scholar 

  15. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press (2018)

    Google Scholar 

  16. Xu, Y., Pi, D.: A reinforcement learning-based communication topology in particle swarm optimization. Neural Comput. Appl. 32(14), 10007–10032 (2019). https://doi.org/10.1007/s00521-019-04527-9

    Article  Google Scholar 

  17. Mirjalili, S.: SCA: a sine cosine algorithm for solving optimization problems. Knowl.-Based Syst. 96, 120–133 (2016)

    Article  Google Scholar 

  18. Kai Feng, Z.: A modified sine cosine algorithm for accurate global optimization of numerical functions and multiple hydropower reservoirs operation. Knowl. Based Syst. 208, 106461 (2020)

    Google Scholar 

  19. Crawford, B., et al.: A comparison of learnheuristics using different reward functions to solve the set covering problem. In: Dorronsoro, B., Amodeo, L., Pavone, M., Ruiz, P. (eds.) OLA 2021. CCIS, vol. 1443, pp. 74–85. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85672-4_6

    Chapter  Google Scholar 

  20. Crawford, B., León de la Barra, C.: Los algoritmos ambidiestros (2020). https://www.mercuriovalpo.cl/impresa/2020/07/13/full/cuerpo-principal/15/. Acceded 12 Feb 2021

  21. Lemus-Romani, J., et al.: Ambidextrous socio-cultural algorithms. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12254, pp. 923–938. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58817-5_65

    Chapter  Google Scholar 

  22. Crawford, B., Soto, R., Astorga, G., García, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017, 1–19 (2017)

    Google Scholar 

  23. Hussain, K., Zhu, W., Salleh, M.N.M.: Long-term memory Harris’ hawk optimization for high dimensional and optimal power flow problems. IEEE Access 7, 147596–147616 (2019)

    Article  Google Scholar 

  24. Morales-Castañeda, B., Zaldivar, D., Cuevas, E., Fausto, F., Rodríguez, A.: A better balance in metaheuristic algorithms: does it exist? Swarm Evol. Comput. 54, 100671 (2020)

    Google Scholar 

  25. Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18, 50–60 (1947)

    Google Scholar 

  26. Lanza-Gutierrez, J.M., Crawford, B., Soto, R., Berrios, N., Gomez-Pulido, J.A., Paredes, F.: Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization. Expert Syst. Appl. 70, 67–82 (2017)

    Article  Google Scholar 

  27. Bisong, E.: Google colaboratory. In: Building Machine Learning and Deep Learning Models on Google Cloud Platform, pp. 59–64. Apress, Berkeley, CA (2019). https://doi.org/10.1007/978-1-4842-4470-8_7

    Chapter  Google Scholar 

Download references

Acknowledgement

Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1210810. Broderick Crawford, Ricardo Soto and Marcelo Becerra-Rozas are supported by Grant Nucleo de Investigacion en Data Analytics/VRIEA/PUCV/039.432/2020. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1190129. Marcelo Becerra-Rozas are supported by Grant DI Investigación Interdisciplinaria del Pregrado/VRIEA/PUCV/039.421/2021. Marcelo Becerra-Rozas is supported by National Agency for Research and Development (ANID)/Scholarship Program/DOCTORADO NACIONAL/2021-21210740. José Lemus-Romani is supported by National Agency for Research and Development (ANID)/Scholarship Program/DOCTORADO NACIONAL/2019-21191692.

Author information

Authors and Affiliations

  1. Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile

    Marcelo Becerra-Rozas, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo, Andrés Trujillo Embry, Máximo Arnao Molina, Diego Tapia & Mauricio Castillo

  2. Pontificia Universidad Católica de Chile, Santiago, Chile

    José Lemus-Romani

  3. Universidad Bernardo O’Higgins, Santiago, Chile

    José-Miguel Rubio

Authors
  1. Marcelo Becerra-Rozas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Lemus-Romani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ricardo Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Felipe Cisternas-Caneo
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Andrés Trujillo Embry
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Máximo Arnao Molina
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Diego Tapia
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Mauricio Castillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  10. José-Miguel Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcelo Becerra-Rozas .

Editor information

Editors and Affiliations

  1. University of Cadiz, Cadiz, Spain

    Bernabé Dorronsoro

  2. Université de Technologie de Troyes, Troyes, France

    Farouk Yalaoui

  3. University of Lille/Inria, Lille, France

    El-Ghazali Talbi

  4. University of Luxembourg, Esch-sur-Alzette, Luxembourg

    Grégoire Danoy

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Becerra-Rozas, M. et al. (2022). A New Learnheuristic: Binary SARSA - Sine Cosine Algorithm (BS-SCA). In: Dorronsoro, B., Yalaoui, F., Talbi, EG., Danoy, G. (eds) Metaheuristics and Nature Inspired Computing. META 2021. Communications in Computer and Information Science, vol 1541. Springer, Cham. https://doi.org/10.1007/978-3-030-94216-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-94216-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-94215-1

  • Online ISBN: 978-3-030-94216-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation