Novel Particle Swarm Optimization for Unconstrained Problems

被引:0
|
作者
Wu, Peifeng [1 ]
Zhang, Jianhua [1 ]
机构
[1] North China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R China
关键词
Exploration; Exploitation; Convergence speed;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Estimation of Distribution Algorithm (EDA) is a class of evolutionary algorithms which construct the probabilistic model of the search space and generate new solutions according to the probabilistic model. Particle Swarm Optimization (PSO) is an algorithm that simulates the behavior of birds flocks and has good local search ability. This paper proposes a combination (EDAPSO) of EDA with PSO for the global optimization problems. The EDAPSO proposed in this paper combines the exploration of EDA with the exploitation of PSO. EDAPSO can perform a global search over the entire search space with faster convergence speed. EDAPSO has two main steps. First, the algorithm generates new solutions according to the probabilistic model. Then, EDAPSO updates the whole population according to improved velocity updating equation. EDAPSO has been evaluated on a series of benchmark functions. The results of experiments show that EDAPSO can produce a significant improvement in terms of convergence speed, solution accuracy and reliability.
引用
收藏
页码:368 / 372
页数:5
相关论文
共 50 条
  • [1] Two-layer particle swarm optimization for unconstrained optimization problems
    Chen, Chia-Chong
    [J]. APPLIED SOFT COMPUTING, 2011, 11 (01) : 295 - 304
  • [2] Modified Particle Swarm Optimization for Unconstrained Optimization
    Zhou, Zhigang
    [J]. 2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 5, 2010, : 377 - 380
  • [3] A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
    Zhang, Changsheng
    Ning, Jiaxu
    Lu, Shuai
    Ouyang, Dantong
    Ding, Tienan
    [J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (02) : 117 - 122
  • [4] A novel particle swarm optimization for constrained optimization problems
    Li, XY
    Tian, P
    Kong, M
    [J]. AI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2005, 3809 : 1305 - 1310
  • [5] Hybrid Particle Swarm Optimization with a Modified Arithmetical Crossover for Solving Unconstrained Optimization Problems
    Ali, Ahmed F.
    Tawhid, Mohamed A.
    [J]. INFOR, 2015, 53 (03) : 125 - 141
  • [6] Evolutionary computation of unconstrained and constrained problems using a novel momentum-type particle swarm optimization
    Liu, Jenn-Long
    Lin, Jiann-Horng
    [J]. ENGINEERING OPTIMIZATION, 2007, 39 (03) : 287 - 305
  • [7] An Adaptive Particle Swarm Optimization Algorithm for Unconstrained Optimization
    Qian, Feng
    Mahmoudi, Mohammad Reza
    Parvin, Hamid
    Pho, Kim-Hung
    Tuan, Bui Anh
    [J]. COMPLEXITY, 2020, 2020
  • [8] A Novel Particle Swarm Optimization for Constrained Engineering Optimization Problems
    Jiao, Minghai
    Tang, Jiafu
    [J]. ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2008, 5370 : 79 - +
  • [9] A Hybrid Jumping Particle Swarm Optimization Method for High Dimensional Unconstrained Discrete Problems
    Seren, Cedric
    [J]. 2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 1649 - 1656
  • [10] The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
    Lin, Geng
    Guan, Jian
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2014, 52 (08): : 55 - 61