A modified differential evolution algorithm for unconstrained optimization problems

被引:69
|
作者
Zou, Dexuan [1 ]
Wu, Jianhua [2 ]
Gao, Liqun [2 ]
Li, Steven [3 ]
机构
[1] Jiangsu Normal Univ, Sch Elect Engn & Automat, Xuzhou 221116, Jiangsu, Peoples R China
[2] Northeastern Univ, Sch Informat Sci & Engn, Shenyang 110004, Liaoning, Peoples R China
[3] Univ S Australia, Div Business, Adelaide, SA 5001, Australia
基金
中国国家自然科学基金;
关键词
Modified differential evolution algorithm; Gauss distribution; Uniform distribution; External archive; Mutation; Central solution; SYSTEMS; COLONY;
D O I
10.1016/j.neucom.2013.04.036
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A modified differential evolution algorithm (MDE) is proposed to solve unconstrained optimization problems in this paper. Gauss distribution and uniform distribution have one thing in common, that is randomness or indeterminateness. Due to this characteristic, MDE employs both distributions to adjust scale factor and crossover rate, which is useful to increase the diversity of the entire population. To guarantee the quality of the swarm, MDE uses an external archive, and some solutions of high quality in this external archive can be selected for candidate solutions. MDE adopts two common mutation strategies to produce new solutions, and the information of global best solution is more likely to be utilized for the mutation during late evolution process, which is beneficial to improving the convergence of the proposed algorithm. In addition, a central solution is generated in terms of all the other candidate solutions, and it can provide a potential searing direction. Experimental results show that MDE algorithm can yield better objective function values than the other six DE algorithms for some unconstrained optimization problems, thus it is an efficient alternative on solving unconstrained optimization problems. (c) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:469 / 481
页数:13
相关论文
共 50 条
  • [21] An Opposition-based Modified Differential Evolution Algorithm for Numerical Optimization Problems
    Xia, Honggang
    Wang, Qingzhou
    AUTOMATIC CONTROL AND MECHATRONIC ENGINEERING II, 2013, 415 : 309 - +
  • [22] A New Modified Trust Region Algorithm for Solving Unconstrained Optimization Problems
    Niri, T. Dehghan
    Hosseini, M. M.
    Heydari, M.
    JOURNAL OF MATHEMATICAL EXTENSION, 2018, 12 (04) : 115 - 135
  • [23] Modified Differential Evolution for Constrained Optimization Problems
    Ali, Musrrat
    Pant, Millie
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2011), VOL 1, 2012, 130 : 933 - +
  • [24] Kinship-based differential evolution algorithm for unconstrained numerical optimization
    Giovanni Formica
    Franco Milicchio
    Nonlinear Dynamics, 2020, 99 : 1341 - 1361
  • [25] Kinship-based differential evolution algorithm for unconstrained numerical optimization
    Formica, Giovanni
    Milicchio, Franco
    NONLINEAR DYNAMICS, 2020, 99 (02) : 1341 - 1361
  • [26] Ε-differential evolution algorithm for constrained optimization problems
    Zheng, Jian-Guo
    Wang, Xiang
    Liu, Rong-Hui
    Ruan Jian Xue Bao/Journal of Software, 2012, 23 (09): : 2374 - 2387
  • [27] An Improved Differential Evolution Algorithm for Optimization Problems
    Zhang, Libiao
    Xu, Xiangli
    Zhou, Chunguang
    Ma, Ming
    Yu, Zhezhou
    ADVANCES IN COMPUTER SCIENCE, INTELLIGENT SYSTEM AND ENVIRONMENT, VOL 1, 2011, 104 : 233 - +
  • [28] A MODIFIED BFGS ALGORITHM FOR UNCONSTRAINED OPTIMIZATION
    YUAN, YX
    IMA JOURNAL OF NUMERICAL ANALYSIS, 1991, 11 (03) : 325 - 332
  • [29] Improved Multi-operator Differential Evolution Algorithm for Solving Unconstrained Problems
    Sallam, Karam M.
    Elsayed, Saber M.
    Chakrabortty, Ripon K.
    Ryan, Michael J.
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [30] A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems
    Diphofu, Thamiso
    Kaelo, Professor
    Tufa, Abebe R.
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (02) : 817 - 835