微信服务号

微信订阅号

2025-5-13- 1
Home > Archive>Volume 23, Issue 7, 2012 >1760-1772. DOI:10.3724/SP.J.1001.2012.04151
PDF HTML XML Export Cite reminder
Nature Computation with Self-Adaptive Dynamic Control Strategy of Population Size
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [15]
    • |
  • Related [20]
    • | | |
  • Comments
    Abstract:

    A new self-adaptive dynamic control strategy of population size is proposed. This strategy can be easily combined with various nature computation methods because its implementation is independent of the evolutionary operation details. The framework of the strategy is first given. Based on the framework, the study proposes a method which can vary the number of increase/decrease on the basis of the logistic model. The study also designs an increase operator giving consideration to the effectiveness and diversity adaptively, as well as a decrease operator with the diversity. The strategy is applied to two different nature computation methods. Experimental evaluation is conducted on both a set of standard test functions and a new set of benchmark functions CEC05. The results show that the new algorithms with proposed strategy outperform the original algorithms on both the precision and convergence rate.

    Reference
    [1] Castro LN. Fundamentals of natural computing: An overview. Physics of Life Reviews, 2007,4(1):1-36. [doi: 10.1016/j.plrev.2006.10.002]
    [2] Arabas J, Michalewicz Z, Mulawka J. GAVaPS—A genetic algorithm with varying population Size. In: Fogel D, ed. Proc. of the1st IEEE Conf. on Evolutionary Computation. Orlando: IEEE Press, 1994. 73-78. [doi: 10.1109/ICEC.1994.350039]
    [3] Shi XH, Wan LM, Lee HP, Yang XW, Wang LM, Liang YC. An improved genetic algorithm with variable population size and aPSO-GA based hybrid evolutionary algorithm. In: Pan ZS, Chen SC, eds. Proc. of the 2nd Int’l Conf. on Machine Learning andCybernetics. Xi’an: IEEE Press, 2003. 1735-1740. [doi: 10.1109/ICMLC.2003.1259777]
    [4] Teo J. Exploring dynamic self-adaptive populations in differential evolution. Soft computing — A fusion of foundations.Methodologies and Applications, 2006,10(8):673-686. [doi: 10.1007/s00500-005-0537-1]
    [5] Brest J, Zamuda A, Boskovic B, Maucec MS, Zumer V. High-Dimensional real-parameter optimization using self-adaptivedifferential evolution algorithm with population size reduction. In: Suganthan PN, ed. Proc. of the IEEE Congress on EvolutionaryComputation. Hong Kong: IEEE Press, 2008. 2032-2039. [doi: 10.1109/CEC.2008.4631067]
    [6] Soudan B, Saad M. An evolutionary dynamic population size PSO implementation. In: Rifai S, Shalati S, eds. Proc. of the 3rd Int’lConf. on Information and Communication Technologies: From Theory to Applications. Damascus: ICTTA, 2008. 1-5. [doi:10.1109/ICTTA.2008.4530016]
    [7] Hsieh ST, Sun TY, Liu CC, Tsai SJ. Solving large scale global optimization using improved particle swarm optimizer. In:Suganthan PN, ed. Proc. of the IEEE Congress on Evolutionary Computation. Hong Kong: IEEE Press, 2008. 1777-1784. [doi:10.1109/CEC.2008.4631030]
    [8] Leong WF, Yen GG. PSO-Based multiobjective optimization with dynamic population size and adaptive local archives. IEEE Trans.on Systems, Man, and Cybernetics—Part B: Cybernetics, 2008,38(5):1270-1293. [doi: 10.1109/TSMCB.2008.925757]
    [9] Tsoularis A, Wallace J. Analysis of logistic growth models. Mathematical Biosciences, 2002,179(1):21-55. [doi: 10.1016/S0025-5564(02)00096-2]
    [10] Arumugam MS, Rao MVC. On the improved performances of the particle swarm optimization algorithms with adaptive parameters,cross-over operators and root mean square (RMS) variants for computing optimal control of a class of hybrid systems. Applied SoftComputing, 2008,8(1):324-336. [doi: 10.1016/j.asoc.2007.01.010]
    [11] Storn R, Price K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. Journalof Global Optimization, 1997,11(4):341-359. [doi: 10.1023/A:1008202821328]
    [12] Kennedy J, Eberhart R. Particle swarm optimization. In: Proc. of the IEEE Int’l Conf. on Neural Networks. Piscataway: IEEEService Center, 1995. 1942-1948. http://ieeexplore.ieee.org/search/searchresult.jsp?matchBoolean%3Dtrue%26searchField%3DSearch_All%26queryText%3D%28p_Title%3AParticle+swarm+optimization%29&addRange=1995_1995_Publication_Year&pageNumber=1&resultAction=REFINE
    [13] Yao X, Liu Y. Evolutionary programming made faster. IEEE Trans. on Evolutionary Computation, 1999,3(2):82-102. [doi:10.1109/4235.771163]
    [14] Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S. Problem definitions and evaluation criteria for the CEC2005 special session on real-parameter optimization. Technical Report, Report No.2005005, Singapore: Nanyang TechnologicalUniversity, 2005.
    [15] Eiben AE, Hinterding R, Michalewicz Z. Parameter control in evolutionary algorithms. IEEE Trans. on Evolutionary Computation,1999,3(2):124-141. [doi: 10.1109/4235.771166]
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

王蓉芳,焦李成,刘芳,杨淑媛.自适应动态控制种群规模的自然计算方法.软件学报,2012,23(7):1760-1772

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 10,2011
  • Revised:November 02,2011
  • Online: July 03,2012
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2044067Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063