Skip to main content

Charged System Search Algorithm

  • Chapter
  • First Online:
Metaheuristics: Outlines, MATLAB Codes and Examples

Abstract

Charged System Search (CSS) algorithm was developed by Kaveh and Talatahari [1, 2] as an efficient population-based metaheuristic using some principles from physics and mechanics and was applied successfully to various types of structural optimization problems [3–7]. CSS utilizes the governing Coulomb laws from electrostatics and the Newtonian laws of mechanics. In this algorithm each agent is a charged particle with a predetermined radius. The charge of magnitude of particles is considered based on their quality. Each particle creates an electric field, which exerts a force on other electrically charged objects. Therefore, charged particles can affect each other based on their fitness values and their separation distance. The quantity of the resultant force is determined by using the electrostatics laws, and the quality of the movement is determined using Newtonian mechanics laws.

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 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Kaveh A, Talatahari S (2010) Optimal design of skeletal structures via the charged system search algorithm. Struct Multidiscip Optim 41:893–911

    Article  Google Scholar 

  2. Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289

    Article  Google Scholar 

  3. Kaveh A, Talatahari S (2010) Charged system search for optimum grillage system design using the LRFD-AISC code. J Construct Steel Res 66:767–771

    Article  Google Scholar 

  4. Kaveh A, Talatahari S (2011) Geometry and topology optimization of geodesic domes using charged system search. Struct Multidiscip Optim 43:215–229

    Article  Google Scholar 

  5. Talatahari S, Kaveh A, Mohajer Rahbari N (2012) Parameter identification of Bouc-Wen model for MR fluid dampers using adaptive charged system search optimization. J Mech Sci Tecnol 26:2523–2534

    Article  Google Scholar 

  6. Kaveh A, Talatahari S, Farahmand Azar B (2012) Optimum design of composite open channels using charged system search algorithm. Iran J Sci Technol Trans Civ Eng 36(C1):67

    Google Scholar 

  7. Kaveh A, Talatahari S (2012) Charged system search for optimal design of frame structures. Appl Soft Comput 12:382–393

    Article  Google Scholar 

  8. Kaveh A, Talatahari S (2009) Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Comput Struct 87(5–6):267–283

    Article  Google Scholar 

  9. Kaveh A, Motie Share MA, Moslehi M (2013) A new meta-heuristic algorithm for optimization: magnetic charged system search. Acta Mech 224(1):85–107

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kaveh, A., Bakhshpoori, T. (2019). Charged System Search Algorithm. In: Metaheuristics: Outlines, MATLAB Codes and Examples. Springer, Cham. https://doi.org/10.1007/978-3-030-04067-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04067-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04066-6

  • Online ISBN: 978-3-030-04067-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics