期刊文献+

Improving differential evolution with a new selection method of parents for mutation

Improving differential evolution with a new selection method of parents for mutation
原文传递
导出
摘要 In differential evolution (DE), the salient feature lies in its mutation mechanism that distinguishes it from other evolutionary algorithms. Generally, for most of the DE algorithms, the parents for mutation are randomly chosen from the current population. Hence, all vectors of population have the equal chance to be selected as parents without selective pressure at all. In this way, the information of population cannot be fully exploited to guide the search. To alleviate this drawback and improve the performance of DE, we present a new selection method of parents that attempts to choose individuals for mutation by utilizing the population information effectively. The proposed method is referred as fitnessand-position based selection (FPS), which combines the fitness and position information of population simultaneously for selecting parents in mutation of DE. In order to evaluate the effectiveness of FPS, FPS is applied to the original DE algorithms, as well as several DE variants, for numerical optimization. Experimental results on a suite of benchmark functions indicate that FPS is able to enhance the performance of most DE algorithms studied. Compared with other selection methods, FPS is also shown to be more effective to utilize information of population for guiding the search of DE. In differential evolution (DE), the salient feature lies in its mutation mechanism that distinguishes it from other evolutionary algorithms. Generally, for most of the DE algorithms, the parents for mutation are randomly chosen from the current population. Hence, all vectors of population have the equal chance to be selected as parents without selective pressure at all. In this way, the information of population cannot be fully exploited to guide the search. To alleviate this drawback and improve the performance of DE, we present a new selection method of parents that attempts to choose individuals for mutation by utilizing the population information effectively. The proposed method is referred as fitnessand-position based selection (FPS), which combines the fitness and position information of population simultaneously for selecting parents in mutation of DE. In order to evaluate the effectiveness of FPS, FPS is applied to the original DE algorithms, as well as several DE variants, for numerical optimization. Experimental results on a suite of benchmark functions indicate that FPS is able to enhance the performance of most DE algorithms studied. Compared with other selection methods, FPS is also shown to be more effective to utilize information of population for guiding the search of DE.
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2016年第2期246-269,共24页 中国计算机科学前沿(英文版)
关键词 differential evolution mutation operator parents selection population information numerical optimization differential evolution, mutation operator, parents selection, population information, numerical optimization
  • 相关文献

参考文献2

二级参考文献41

  • 1Dutt S, Deng W Y. A probability-based approach to VLSI circuit par.titioning. In: Proceedings of the 33rd Design Automation Conference. 1996, 100-105.
  • 2Dutt S. Cluster-aware iterative improvement techniques for partition.ing large VLSI circuits. ACM Transactions on Design Automation of Electronic Systems, 2002, 7(1): 91-121.
  • 3Wei Y C, Cheng C K. Ratio cut partitioning for hierarchical designs.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991, 10(7): 911-921.
  • 4Fiduccia C M, Mattheyses B M. A linear-time heuristic for improv.ing network partitions. In: Proceedings of the 19th Design Automation Conference. 1982,175-181.
  • 5Krishnamurthy B. An improved min-cut algorithm for partitioning VLSI networks, IEEE Transactions on Computer. 1984, 100(5): 438- 446.
  • 6Iqbal SMA, Monir M 1, Sayeed T. A concurrent approach to cluster.ing algorithm with applications to VLSI domain. In: Proceedings of the II th International Conference on Computer and Information Tech.nology. 2008, 476-480.
  • 7Li J H, Behjat L. A connectivity based clustering algorithm with appli.cation to VLSI circuit partitioning. IEEE Transactions on Circuits and Systems II: Express Briefs, 2006, 53(5): 384-388.
  • 8Barnard S T, Simon H D. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency:Practice and Experience, 1994,6(2): 101-117.
  • 9Lang K J. Fixing two weaknesses of the spectral method. In: Proceed.ings of the 2005 Neural Infromation Processing Systems. 2005, 715- 722.
  • 10Kolar D, Puksec J D, Branica I. VLSI circuit partition using simulated annealing algorithm. In: Proceedings of the 12th IEEE Mediterranean on Electrotechnical Conference. 2004, 205-208.

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部