scholarly journals Fitness Estimation Based Particle Swarm Optimization Algorithm for Layout Design of Truss Structures

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Ayang Xiao ◽  
Benli Wang ◽  
Chaoli Sun ◽  
Shijie Zhang ◽  
Zhenguo Yang

Due to the fact that vastly different variables and constraints are simultaneously considered, truss layout optimization is a typical difficult constrained mixed-integer nonlinear program. Moreover, the computational cost of truss analysis is often quite expensive. In this paper, a novel fitness estimation based particle swarm optimization algorithm with an adaptive penalty function approach (FEPSO-AP) is proposed to handle this problem. FEPSO-AP adopts a special fitness estimate strategy to evaluate the similar particles in the current population, with the purpose to reduce the computational cost. Further more, a laconic adaptive penalty function is employed by FEPSO-AP, which can handle multiple constraints effectively by making good use of historical iteration information. Four benchmark examples with fixed topologies and up to 44 design dimensions were studied to verify the generality and efficiency of the proposed algorithm. Numerical results of the present work compared with results of other state-of-the-art hybrid algorithms shown in the literature demonstrate that the convergence rate and the solution quality of FEPSO-AP are essentially competitive.

2011 ◽  
Vol 467-469 ◽  
pp. 359-364 ◽  
Author(s):  
Hui Rong Li ◽  
Yue Lin Gao

This paper presents an improve particle swarm optimization algorithm for solving the mixed nonlinear integer programming problems. In this algorithm, the mixed nonlinear integer programming problems is converted into unconstrained bi-objective optimization problem by the dynamic bi-objective constraint handling methods and improved the velocity equation of PSO. Introduction of migration operator in order to overcome the premature phenomenon, retention to the better performance of infeasible particles according to the constraint violation in each iteration, it is effectively maintain the swarm diversity. Numerical experiments show that the proposed algorithm has faster convergence speed and better ability of global optimization.


Sign in / Sign up

Export Citation Format

Share Document