Advertisement
Published in:
2019 | OriginalPaper | Chapter
8. Charged System Search Algorithm
Authors : Ali Kaveh, Taha Bakhshpoori
Published in: Metaheuristics: Outlines, MATLAB Codes and Examples
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.