期刊文献+

Compact Differential Evolution Light: High Performance Despite Limited Memory Requirement and Modest Computational Overhead

Compact Differential Evolution Light: High Performance Despite Limited Memory Requirement and Modest Computational Overhead
原文传递
导出
摘要 Compact algorithms are Estimation of Distribution Algorithms which mimic the behavior of population-based algorithms by means of a probabilistic representation of the population of candidate solutions. These algorithms have a similar behaviour with respect to population-based algorithms but require a much smaller memory. This feature is crucially important in some engineering applications, especially in robotics. A high performance compact algorithm is the compact Differential Evolution (cDE) algorithm. This paper proposes a novel implementation of cDE, namely compact Differential Evolution light (cDElight), to address not only the memory saving necessities but also real-time requirements, cDElight employs two novel algorithmic modifications for employing a smaller computational overhead without a performance loss, with respect to cDE. Numerical results, carried out on a broad set of test problems, show that cDElight, despite its minimal hardware requirements, does not deteriorate the performance of cDE and thus is competitive with other memory saving and population-based algorithms. An application in the field of mobile robotics highlights the usability and advantages of the proposed approach. Compact algorithms are Estimation of Distribution Algorithms which mimic the behavior of population-based algorithms by means of a probabilistic representation of the population of candidate solutions. These algorithms have a similar behaviour with respect to population-based algorithms but require a much smaller memory. This feature is crucially important in some engineering applications, especially in robotics. A high performance compact algorithm is the compact Differential Evolution (cDE) algorithm. This paper proposes a novel implementation of cDE, namely compact Differential Evolution light (cDElight), to address not only the memory saving necessities but also real-time requirements, cDElight employs two novel algorithmic modifications for employing a smaller computational overhead without a performance loss, with respect to cDE. Numerical results, carried out on a broad set of test problems, show that cDElight, despite its minimal hardware requirements, does not deteriorate the performance of cDE and thus is competitive with other memory saving and population-based algorithms. An application in the field of mobile robotics highlights the usability and advantages of the proposed approach.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2012年第5期1056-1076,共21页 计算机科学技术学报(英文版)
关键词 differential evolution compact optimization real-time optimization differential evolution, compact optimization, real-time optimization
  • 相关文献

参考文献52

  • 1Norman P G. The new AP101S general-purpose computer (GPC) for the space shuttle. IEEE Proceedings, 1987, 75(3):308-319.
  • 2Qin A K, Huang V L, Suganthan P N. Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Transactions on Evolutionary Computation, 2009, 13(2): 398-417.
  • 3Zhang J, Sanderson A C. JADE: Adaptive differential evolution with optional external archive. IEEE Transactions on Evolutionary Computation, 2009, 13(5): 945-958.
  • 4Handoko S D, Kwoh C K, Ong Y S. Feasibility structure modeling: An effective chaperon for constrained memetic algorithms. IEEE Transactions on Evolutionary Computation, 2010, 14(5): 740-758.
  • 5Priigel-Bennet A. Benefits of a population: Five mechanisms that advantage population-based algorithms. IEEE Transactions on Evolutionary Computation, 2010,14(4): 500-517.
  • 6Larrafiaga P, Lozano J A. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic, 2002.
  • 7Harik G R, Lobo F G, Goldberg DE. The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 287-297.
  • 8Rastegar R, Hariri A. A step forward in studying the compact genetic algorithm. Evolutionary Computation, 2006, 14(3): 277-289.
  • 9Hidalgo J I, Prieto M, Lanchares J et al. Hybrid parallelization of a compact genetic algorithm. In Proc. the 11th Eurornicro Conference on Parallel, Distributed and NetworkBased Processing, Feb. 2003, pp.449-445.
  • 10Lobo F G, Lima C F, Mart ires H. An architecture for massive parallelization of the compact genetic algorithm. In Lecture Notes in Computer Science 3103, Deb K, Poli R, Banzhaf W, et al. (eds.), Springer, 2004, pp.412-413.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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