A study on multidisciplinary collaborative optimisation based on an improved PSO

Authors:
Xiang-wei Zheng;Hong Liu
Affiliations:
School of Information Science and Engineering, Shandong Normal University, No. 88, Wenhua Road (East), Jinan, 250014 P.R. China.;School of Information Science and Engineering, Shandong Normal University, No. 88, Wenhua Road (East), Jinan, 250014 P.R. China
Venue:
International Journal of Computer Applications in Technology
Year:
2009

Citing 1
Cited 4

Unified particle swarm optimization for solving constrained engineering optimization problems

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Optimal operational planning of steam power systems using an IPSOSA algorithm

Journal of Computer and Systems Sciences International
ACO-based BW algorithm for parameter estimation of hidden Markov models

International Journal of Computer Applications in Technology
An improved multi-objective ant colony algorithm for building life cycle energy consumption optimisation

International Journal of Computer Applications in Technology
A self-organisation particle swarm optimisation algorithm based on L norm multi-measurements diversity feedback

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The design of large scale engineering systems becomes more and more complex, therefore collaborative optimisation (CO), one of the multidisciplinary design optimisation (MDO) methods, is often employed to produce optimal solutions. However, CO has disadvantages as increased computational time, slow convergence and unexpected non-linearity of compatibility constraints. In this paper, a CO method based on MLPSO, which is an improved particle swarm optimiser, is proposed to handle above difficulties and is formulated in detail. In the CO framework, MLPSO is served as optimiser both system level and discipline (or subspace) level, which can deal with various objective functions and constraints, some of which cannot be solved by traditional gradient-based optimisation algorithm. An example demonstrates the proposed method and the results show its feasibility and effectiveness.