A Parellelzing Modified Particle Swarm Optimizer and its Application to Discrete Topological Optimization

Abstract:

recently, a modified Particle Swarm Optimizer (MLPSO) has been succeeded in solving truss topological optimization problems and competitive results are obtained. In order to reduce its execution time for solving large complex optimization problem, a parallel version for this optimizer (PMLPSO) is studied in this paper. This paper first gives an overview of PSO algorithm as well as the modified PSO, and then a design and an implementation of parallel PSO is proposed. Since most of structural problems involve discrete design variables, an effect strategy is involved in MLPSO in order to operate on discrete variables. The performance of the proposed algorithm is tested by two examples and promising speed-up rate is obtained. Final part is conclusion and outlook.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 4401-4408
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.4401
• Online since: January 2012
• Authors: Bin Yang, Qi Lin Zhang
• Keywords: Integer Optimization, Nonlinear Programming, Parallel Computing, Particle Swarm Optimizer, Truss Topological Optimization

References

[1] J. Kennedy and R. Eberhart, Particle swarm optimization, IEEE International Conference on Neural Networks, volume 4, (1995).

[2] R. Poli, An analysis of publications on particle swarm optimization applications, Tech. Rep. CSM-469, Department of Computing and Electronic Systems, University of Essex, Colchester, Essex, UK, May–November, (2007).

[3] von den Bergh, An analysis of Particle Swarm Optimizers, Thesis(PhD), University of Pretoria, (2002).

[4] M. Løvberg, T. Rasmussen and T. Krink, Hybrid Particle Swarm Optimiser with Breeding and Subpopulation, Proc. of the Third Genetic and Evolutionary Computation Conference, vol. 1, pp.469-476, (2001).

[5] M. Løvberg and T. Krink, Extending Particle Swarm Optimizers with Self-Organized Criticality, Proc. of the Fourth Congress on Evolutionary Computation, vol. 2, pp.1588-1593, (2002).

DOI: 10.1109/cec.2002.1004479

[6] B. Yang, Kai-Uwe Bletzinger, A modified particle swarm optimizer and its application to spatial truss topological optimization, In Proceedings of IASS 2009 Symposium, Valencia, Spain, (2009).

[7] J.F. Schutte, B.J. Fregly, R.T. Haftka and A. George, A Parallel Particle Swarm Algorithm. In Proceedings of the Fifth World Congress of Structural and Multidisciplinary Optimization, Venice, Italy, (2003).

[8] J. Kennedy and RC Eberhart. A discrete binary version of the particle swarm algorithm. IEEE International conference on Computational Cybernetics and Simulation, volume 5, (1997).

DOI: 10.1109/icsmc.1997.637339

[9] EC Laskari, KE Parsopoulos, and MN Vrahatis. Particle swarm optimization for integer programming. In Proceedings of the IEEE 2002 Congress on Evolutionary Computation, pages 1576-1581, (2002).

DOI: 10.1109/cec.2002.1004478

[10] W. Achtziger and M. Stolpe. Truss topology optimization with discrete design variables-Guaranteed global optimality and benchmark examples. Structural and Mul-tidisciplinary Optimization, 34(1): 1–20, (2007).

DOI: 10.1007/s00158-006-0074-2