A hybrid PSO-GA algorithm for constrained optimization problems
The main objective of this paper is to present a hybrid technique named as a PSO-GA for solving the constrained optimization problems. In this algorithm, particle swarm optimization (PSO) operates in the direction of improving the vector while the genetic algorithm (GA) has been used for modifying t...
Uložené v:
| Vydané v: | Applied mathematics and computation Ročník 274; s. 292 - 305 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.02.2016
|
| Predmet: | |
| ISSN: | 0096-3003, 1873-5649 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | The main objective of this paper is to present a hybrid technique named as a PSO-GA for solving the constrained optimization problems. In this algorithm, particle swarm optimization (PSO) operates in the direction of improving the vector while the genetic algorithm (GA) has been used for modifying the decision vectors using genetic operators. The balance between the exploration and exploitation abilities have been further improved by incorporating the genetic operators, namely, crossover and mutation in PSO algorithm. The constraints defined in the problem are handled with the help of the parameter-free penalty function. The experimental results of constrained optimization problems are reported and compared with the typical approaches exist in the literature. As shown, the solutions obtained by the proposed approach are superior to those of existing best solutions reported in the literature. Furthermore, experimental results indicate that the proposed approach may yield better solutions to engineering problems than those obtained by using current algorithms. |
|---|---|
| ISSN: | 0096-3003 1873-5649 |
| DOI: | 10.1016/j.amc.2015.11.001 |