IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-96935-6_13.html
   My bibliography  Save this book chapter

Sine Cosine Algorithm: Introduction and Advances

In: The Palgrave Handbook of Operations Research

Author

Listed:
  • Anjali Rawat

    (South Asian University)

  • Shitu Singh

    (South Asian University)

  • Jagdish Chand Bansal

    (South Asian University)

Abstract

Sine Cosine AlgorithmSine Cosine Algorithm (SCA) is a new mathematical concept based metaheuristicMetaheuristics algorithm proposed by Seyedali Mirjalili in 2016. This algorithm uses a simple model to solve optimizationOptimization problems and incorporates two trigonometric functions (sine and cosine). Since its inception, various variants of SCA have been developed to improve the search procedure of the original version so that it can cope with the complex nature of optimizationOptimization problems. It has been explored in many fields and is widely used in different areas such as engineering, computer science, medical, and bioinformatics, with or without modifications. Nevertheless, it is still not clearly known how much the algorithm has evolved so far and how far the research and development have been done since its introduction. This chapter attempts to present an extensive overview of the SCA and its extended versions, such as continuous, multi-objective, binary, discrete, constrained, to help the old and new researchers explore the algorithm’s capabilities and performances.

Suggested Citation

  • Anjali Rawat & Shitu Singh & Jagdish Chand Bansal, 2022. "Sine Cosine Algorithm: Introduction and Advances," Springer Books, in: Saïd Salhi & John Boylan (ed.), The Palgrave Handbook of Operations Research, chapter 0, pages 447-467, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-96935-6_13
    DOI: 10.1007/978-3-030-96935-6_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-96935-6_13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.