Bild vom Institut
home uni uni suche search sitemap sitemap kontakt contact
unilogo University of Stuttgart
Institute of Engineering and Computational Mechanics

Particle Swarm Optimization of Mechanical Systems


Project Description

Gradient based optimization methods are widely used in mechanical system optimization. These methods have favorable convergence properties and thus are computationally very efficient. However, these methods cannot be applied to optimization problems that are non-differentiable, multimodal with little knowledge about the initial design. In this case, stochastic methods can be used, because they do not require any gradient information and they even have the possibility to find the global solution. Well known methods are the Simulated Annealing Method, the Evolutionary Strategy and the Genetic Algorithms. In 1995, the the Particle Swarm Optimizer has been introduced and added to this family of optimization methods. This approach is based on the simulation of the social behavior of bird flocks or fish schools.

The goal of this project is to investigate the behavior of the algorithm and to check its applicability to mechanical optimization problems. The simple structure of the basic algorithm allows the implementation of different approaches in order to handle inequality and equality constraints as usually inherent in mechanical optimization problems.
stop animation

A powerful method could be developed by combining the Particle Swarm approach with the Augmented Lagrangian Multiplier method. This ALPSO algorithm identifies automatically the active set of constraints and does not require a feasible initial design. The Augmented Lagrangian Multiplier Method maps the objective function and the constraints to a pseudo objective function by applying an appropriate penalty approach. Unlike classical penalty methods, this approach is insensitive to penalty factors. The pseudo objective function is iteratively updated and sequentially solved by the Particle Swarm Optimizer (animation). The double iterative characteristic and computational overhead is removed by limiting the inner optimization process to only a few iterations. The structure of the algorithm is well suited for using parallel computer architecture in order to further reduce the computational burden associated with stochastic optimization methods. Finally we have implemented ALPSO into our optimization software package AIMS in order to do further investigation and testing.

The following JAVA-Applet written by Florian Seybold (JAVA Version 1.4.2) demonstrates the capability and performance of ALPSO.

Related Pages

- Optimization at the institut
- Particle Swarm Optimization - by James Kennedy and Russell Eberhart
- Particle Swarm Info - a directory of resources pertaining to PSO
- Swarm Intelligence - introduction, bibliography, tutorials and links by Xiaohui Hu


Dr.-Ing. Qirong Tang