Hybrid PSO-SQP Algorithm for Solving System Reliability Allocation Optimization

被引:0
作者
Tang Cheng [1 ]
Guo Shu-xiang [1 ]
Mo Yan-yu [2 ]
机构
[1] Air Force Engn Univ, Coll Sci, Xian 710051, Peoples R China
[2] Air Force Engn Univ, Aeronaut & Astronaut Engn Coll, Xian 710038, Peoples R China
来源
PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON MATERIALS ENGINEERING AND INFORMATION TECHNOLOGY APPLICATIONS | 2015年 / 28卷
关键词
system reliability; reliability allocation; particle swarm optimization; sequential quadratic programming;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
System reliability allocation is an important ingredient in system reliability design, and it is also a decision-making issue of reliability engineering. To achieve the optimization of system reliability allocation, an optimization model for system reliability allocation, which takes the system cost as the objective function, is constructed through the general cost function. In order to overcome the shortcomings of particle swarm optimization (PSO) appearing in reliability allocation optimization, the premature and/or slow speed of convergence in later period, the sequential quadratic programming (SQP) was introduced to improve the PSO algorithm. The algorithm uses PSO as the global optimizer while the SQP is employed for accelerating the local search. Thus, the particles are able to search the whole space while searching for local optimization fast, which not only assures the convergence of the algorithm, but also increases the probability of obtaining the global optimum. Applied the algorithm to the problem of system reliability allocation, the simulation results show that it has excellent global search capability and provides rational optimization results compared to the existing approaches.
引用
收藏
页码:490 / 495
页数:6
相关论文
共 50 条
  • [41] A hybrid PSO-GA algorithm for optimization of laminated composites
    Barroso, Elias Saraiva
    Parente, Evandro, Jr.
    Cartaxo de Melo, Antonio Macario
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2017, 55 (06) : 2111 - 2130
  • [42] A hybrid PSO-GA algorithm for constrained optimization problems
    Garg, Harish
    APPLIED MATHEMATICS AND COMPUTATION, 2016, 274 : 292 - 305
  • [43] A Robust Power Allocation Algorithm for Cognitive Radio Networks Based on Hybrid PSO
    Zhao, Lu
    Zhou, Mingyue
    SENSORS, 2022, 22 (18)
  • [44] Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm
    Li, Junqing
    Pan, Quan-Ke
    Suganthan, P. N.
    Tasgetiren, M. Fatih
    SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7269 : 275 - 282
  • [45] Resource Allocation for ISAC and HRLLC in UAV-Assisted HSR System With a Hybrid PSO-Genetic Algorithm
    Qiao, Yuanyuan
    Niu, Yong
    Han, Zhu
    Xiong, Lei
    Wang, Ning
    Quek, Tony Q. S.
    Ai, Bo
    IEEE INTERNET OF THINGS JOURNAL, 2025, 12 (06): : 6790 - 6804
  • [46] Particle swarm optimization (PSO) algorithm for optimal machining allocation of clutch assembly
    A. Noorul Haq
    K. Karthikeyan
    K. Sivakumar
    R. Saravanan
    The International Journal of Advanced Manufacturing Technology, 2006, 27 : 865 - 869
  • [47] CS-PSO: chaotic particle swarm optimization algorithm for solving combinatorial optimization problems
    Xu, Xiaolong
    Rong, Hanzhong
    Trovati, Marcello
    Liptrott, Mark
    Bessis, Nik
    SOFT COMPUTING, 2018, 22 (03) : 783 - 795
  • [48] Genetic Algorithm Based Reliability Optimization Allocation Method of Elevator
    Liu Yongjun
    Yang Yong
    2017 2ND INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION ENGINEERING (ICRAE), 2017, : 168 - 171
  • [49] CS-PSO: chaotic particle swarm optimization algorithm for solving combinatorial optimization problems
    Xiaolong Xu
    Hanzhong Rong
    Marcello Trovati
    Mark Liptrott
    Nik Bessis
    Soft Computing, 2018, 22 : 783 - 795
  • [50] Solving constrained optimization problems with a hybrid particle swarm optimization algorithm
    Cecilia Cagnina, Leticia
    Cecilia Esquivel, Susana
    Coello Coello, Carlos A.
    ENGINEERING OPTIMIZATION, 2011, 43 (08) : 843 - 866