Charged system search for optimal design of frame structures

Authors:
A. Kaveh;S. Talatahari
Affiliations:
Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Tehran, Iran;Marand Faculty of Engineering, University of Tabriz, Tabriz, Iran
Venue:
Applied Soft Computing
Year:
2012

Citing 5
Cited 5

Particle swarm approach for structural design optimization

Computers and Structures
Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures

Computers and Structures
Size optimization of space trusses using Big Bang-Big Crunch algorithm

Computers and Structures
Optimum design of skeletal structures using imperialist competitive algorithm

Computers and Structures
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A survey of non-gradient optimization methods in structural engineering

Advances in Engineering Software
A new optimization method: Dolphin echolocation

Advances in Engineering Software
Novel Adaptive Charged System Search algorithm for optimal tuning of fuzzy controllers

Expert Systems with Applications: An International Journal
Bat inspired algorithm for discrete size optimization of steel frames

Advances in Engineering Software
Stud krill herd algorithm

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The charged system search (CSS) algorithm is utilized for design of frame structures. The algorithm is inspired by the laws in physics. The CSS utilizes a number of charged particles which influence each other based on their fitness values and their separation distances considering the governing law of Coulomb. A comparison between the characteristics of the CSS algorithm and other well-known meta-heuristics is performed to indicate their similarities and differences. Some benchmark frame examples are optimized with the CSS algorithm. Comparison of the results of CSS with some other meta-heuristic algorithms shows the robustness of the new algorithm.