PSOLVER: A new hybrid particle swarm optimization algorithm for solving continuous optimization problems

Kayhan, Ali Haydar; Ceylan, Hüseyin; Ayvaz, M. Tamer; Gürarslan, Gürhan

doi:10.1016/j.eswa.2010.03.046

Cited by 41 publications

(14 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These examples have also been solved by other optimization algorithms and the results may be found in Ayvaz et al (2009) and Kayhan et al (2010). Next, the efficiency of SHS is tested for solving sizing optimization of structures for multiple frequency constraints.…”

Section: Pressure Vessel Designmentioning

confidence: 99%

Shape optimization of structures for frequency constraints by sequential harmony search algorithm

Gholizadeh

Barzegar

2013

Engineering Optimization

View full text Add to dashboard Cite

Shape optimization of structures with frequency constraints is a highly nonlinear dynamic optimization problem. In order to deal with this type of optimization problem, efficient optimization algorithms should be employed. The main objective of the present study is to propose an efficient harmony search (HS)-based algorithm for solving the shape optimization problem of pin-jointed structures subject to multiple natural frequency constraints. In the proposed algorithm an enhanced version of HS is employed in the framework of the sequential unconstrained minimization technique. The efficiency of the presented sequential harmony search (SHS) algorithm is illustrated through several benchmark optimization examples and the results are compared to those of different optimization techniques. The numerical results demonstrate the computational advantages of the SHS in shape optimization of structures for frequency constraints.

show abstract

Section: Pressure Vessel Designmentioning

confidence: 99%

Shape optimization of structures for frequency constraints by sequential harmony search algorithm

Gholizadeh

Barzegar

2013

Engineering Optimization

View full text Add to dashboard Cite

show abstract

“…10. The aim of this problem is to design, with the minimum cost of manufacturing, a welded beam which is subjected to the constraints on the shear stress t , the bending stress s , the buckling load Table 1 BA [12] PSOLVER [13] EHGA [14] ABC [15] TLBO [16] CS [17] HGSO [18] Loop . The mathematical formulation of the objective function is presented in Eqs.…”

Section: Welded Beam Designmentioning

confidence: 99%

“…11 is reduction of the weight of the reducer with the constraints on bending stress of the gear teeth, surface stress, transverse deflection of the shafts and stresses in the shafts. The design parameters of the singlestage speed reducer are: the face width ( ) BA [12] S-APA [28] PSOLVER [13] EHGA [14] ABC [15] TLBO [ 1.1 1.9 1 0.…”

Section: Speed Reducer Designmentioning

confidence: 99%

Loop bat family algorithm (Loop BFA) for constrained optimization

Miodragović¹,

Bulatović

2015

J Mech Sci Technol

View full text Add to dashboard Cite

The standard Bat algorithm (BA) is extended by introducing a bat family for the purpose of continuous repetition of the procedure for searching for an optimal solution. The standard BA is modified by including the loop search in the zone of solutions. For each bat, in each family, fine search according to the step of Lévy-flight is used for looking for an improved solution until the given constraints are satisfied. Such solutions are compared for each bat family and the best one is selected. The loop bat family algorithm (Loop BFA) is tested on five engineering examples known in the literature. The correctness and efficiency of the proposed algorithm are verified by good results in these examples.

show abstract

“…Pedamallu and Ozdamar [21] dealt with integrating the simulated annealing algorithm with a feasible sequential quadratic programming. Kayhan et al [22] included a spreadsheet solver in the particle swarm optimization as a global search to improve the results. Mohammad Nezhad and Mahlooji [23] invoked the theory of discrete Lagrange multipliers in a revised particle swarm optimization to arrive at discrete saddle points.…”

Section: Introductionmentioning

confidence: 99%