𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems

✍ Scribed by W.F. Abd-El-Wahed; A.A. Mousa; M.A. El-Shorbagy


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
634 KB
Volume
235
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Comprehensive learning particle swarm op
✍ V.L. Huang; P.N. Suganthan; J.J. Liang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 263 KB

This article presents an approach to integrate a Pareto dominance concept into a comprehensive learning particle swarm optimizer ~CLPSO! to handle multiple objective optimization problems. The multiobjective comprehensive learning particle swarm optimizer ~MOCLPSO! also integrates an external archiv

Application of particle swarm optimizati
✍ R.J. Kuo; C.C. Huang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 436 KB

Bi-level linear programming is a technique for modeling decentralized decision. It consists of the upper-level and lower-level objectives. This paper attempts to develop an efficient method based on particle swarm optimization (PSO) algorithm with swarm intelligence. The performance of the proposed

Solving structural optimization problems
✍ Salvador Botello; Jose L. Marroquin; Eugenio OΓ±ate; Johan Van Horebeek πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 2 views

In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal

An improved particle swarm optimization
✍ Peifeng Wu; Liqun Gao; Dexuan Zou; Steven Li πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 496 KB

An improved particle swarm optimization (IPSO) algorithm is proposed to solve reliability problems in this paper. The IPSO designs two position updating strategies: In the early iterations, each particle flies and searches according to its own best experience with a large probability; in the late it