Research on Constrained Layout Optimization Problem Using Multi-adaptive Strategies Particle Swarm Optimizer

Author(s):  
Kaiyou Lei
Author(s):  
Leandro dos Santos Coelho ◽  
Viviana Cocco Mariani

Particle swarm optimization (PSO) is a population-based swarm intelligence algorithm that shares many similarities with evolutionary computation techniques. However, the PSO is driven by the simulation of a social psychological metaphor motivated by collective behaviours of bird and other social organisms instead of the survival of the fittest individual. Inspired by the classical PSO method and quantum mechanics theories, this work presents new Quantum-behaved PSO (QPSO) approaches using mutation operator with exponential probability distribution. The simulation results demonstrate good performance of the QPSO in solving a well-studied continuous optimization problem of mechanical engineering design.


2015 ◽  
Vol 713-715 ◽  
pp. 1525-1529
Author(s):  
Di Ming Ai ◽  
Yu Fei Jia ◽  
Jun Yan Zhao ◽  
Ling Jie Kong

A aircraft parking position assignment problem is a complex optimization problem with many constrains. In this paper, an assignment model is built with the consideration of constrain treatment. A 2 neighborhood particle swarm optimizer is adopted. The numerical experiment results demonstrate the effectiveness of proposed model and optimization strategy.


2011 ◽  
Vol 383-390 ◽  
pp. 1071-1076
Author(s):  
Bin Yang ◽  
Qi Lin Zhang

As a new paradigm of Swarm Intelligence which is inspired by concepts from ’Social Psychology’ and ’Artificial Life’, the Particle Swarm Optimization (PSO), it is widely applied to various kinds of optimization problems especially of nonlinear, non-differentiable or non-convex types. In this paper, a modified guaranteed converged particle swarm algorithm (MGCPSO) is proposed in this paper, which is inspired by guaranteed converged particle swarm algorithm (GCPSO) proposed by von den Bergh. The section sizing optimization problem of steel framed structure subjected to various constraints based on Chinese Design Code are selected to illustrate the performance of the presented optimization algorithm.


2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Tae-Hyoung Kim ◽  
Ichiro Maruta ◽  
Toshiharu Sugie ◽  
Semin Chun ◽  
Minji Chae

This paper studies the metaheuristic optimizer-based direct identification of a multiple-mode system consisting of a finite set of linear regression representations of subsystems. To this end, the concept of a multiple-mode linear regression model is first introduced, and its identification issues are established. A method for reducing the identification problem for multiple-mode models to an optimization problem is also described in detail. Then, to overcome the difficulties that arise because the formulated optimization problem is inherently ill-conditioned and nonconvex, the cyclic-network-topology-based constrained particle swarm optimizer (CNT-CPSO) is introduced, and a concrete procedure for the CNT-CPSO-based identification methodology is developed. This scheme requires no prior knowledge of the mode transitions between subsystems and, unlike some conventional methods, can handle a large amount of data without difficulty during the identification process. This is one of the distinguishing features of the proposed method. The paper also considers an extension of the CNT-CPSO-based identification scheme that makes it possible to simultaneously obtain both the optimal parameters of the multiple submodels and a certain decision parameter involved in the mode transition criteria. Finally, an experimental setup using a DC motor system is established to demonstrate the practical usability of the proposed metaheuristic optimizer-based identification scheme for developing a multiple-mode linear regression model.


Sign in / Sign up

Export Citation Format

Share Document