GSA: A gravitational search algorithm
DOI10.1016/j.ins.2009.03.004zbMath1177.90378OpenAlexW2072955302WikidataQ63468125 ScholiaQ63468125MaRDI QIDQ2390346
Esmat Rashedi, Saeid Saryazdi, Hossein Nezam Abadi Pour
Publication date: 22 July 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.03.004
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (only showing first 100 items - show all)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Multi-strategy ensemble particle swarm optimization for dynamic optimization
- A tabu search approach for the minimum sum-of-squares clustering problem
- A proof of convergence for ant algorithms.
- Fingerprint matching by genetic algorithms
- Robust PID controller tuning based on the constrained particle swarm optimization
- Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients
- Improving genetic algorithms' performance by local search for continuous function optimization
- A study of particle swarm optimization particle trajectories
- Ant colony optimization algorithm and its application to Neuro-Fuzzy controller design
- Practical Genetic Algorithms
This page was built for publication: GSA: A gravitational search algorithm