Browsing by Subject "Global optimization"

DSpace Home →
Browsing by Subject

Browsing by Subject "Global optimization"

0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z

Or enter first few letters:

Sort by: Order: Results:

Now showing items 1-2 of 2

Improved particle swarm algorithms for global optimization

Ali, M.M.; Kaelo, P. (Elsevier Ltd. www.elevier.com/locate/amc, NaN, 2008)

[more]

[less]

Abstract:

Particle swarm optimization algorithm has recently gained much attention in the global optimization research community. As a result, a few variants of the algorithm have been suggested. In this paper, we study the efficiency and robustness of a number of particle swarm optimization algorithms and identify the cause for their slow convergence. We then propose some modifications in the position update rule of particle swarm optimization algorithm in order to make the convergence faster. These modifications result in two new versions of the particle swarm optimization algorithm. A numerical study is carried out using a set of 54 test problems some of which are inspired by practical applications. Results show that the new algorithms are much more robust and efficient than some existing particle swarm optimization algorithms. A comparison of the new algorithms with the differential evolution algorithm is also made.

URI:

http://hdl.handle.net/10311/178

Files in this item: 2

Ali_Kaelo_AMC_2008.pdf (3.814Mb)

license.txt (1.998Kb)

A numerical study of some modified differential evolution algorithms

Kaelo, P.; Ali, M.M. (Elsevier; www.elsevier.com/locate/ejor, NaN, 2006)

[more]

[less]

Abstract:

Modifications in mutation and localization in acceptance rule are suggested to the differential evolution algorithm for global optimization. Numerical experiments indicate that the resulting algorithms are considerably better than the original differential evolution algorithm. Therefore, they offer a reasonable alternative to many currently available stochastic algorithms, especially for problems requiring 'direct search type' methods. Numerical study is carried out using a set of 50 test problems many of which are inspired by practical applications.

URI:

http://hdl.handle.net/10311/64

Files in this item: 2

kaelo_EJOP_2006.pdf (1.708Mb)

license.txt (1.998Kb)

Now showing items 1-2 of 2

Search DSpace

Advanced Search

Browse

All of DSpace

My Account

Login
Register

Contact Us | Send Feedback