期刊文献+

MEMETIC算法在多峰连续函数优化问题中的应用 被引量:2

Application of Memetic Algorithm in Continuous Function Optimizations
下载PDF
导出
摘要 根据多峰连续函数优化问题的特点,在Memetic算法的框架下,采用了爬山局部搜索与自适应多点交叉、随机变异相结合的策略对染色体群体进行优化,有效避免算法陷入局部最优,提高了算法的效率。数值计算表明Memetic算法在求解多峰连续函数优化问题上具有很好的效果。 According to the characteristics of continuous function optimizations,the strategy is adopted by association of climbing method as the local search,adaptive multi-point cross and random mutation to optimize the chromosome population,it avoided the algorithm fall into the local optimal effectively and improved the algorithm s efficiency.Numerical experiment indicated that the memetic algorithm have a good effect for solution of the continuous function optimizations.
作者 屈爱平
机构地区 怀化学院数学系
出处 《科学技术与工程》 2010年第1期187-189,共3页 Science Technology and Engineering
基金 湖南省教育厅项目(08C668)资助
关键词 多峰连续函数优化 爬山局部搜索 MEMETIC算法 continuous function optimizations climbing local search method Memetic algorithm
  • 相关文献

参考文献3

  • 1Moscato P, Norman M G. A Memetic approach for the travelling salesman problem- implementation of a computational ecology for combinatorial optimization on message- passing systems. In: Proceedings of the International Conference on Parallel Computing and Transport Applications, 1992.
  • 2高亮,刘文君,周驰.用Memetic算法求解有时间约束的TSP问题[J].华中科技大学学报(自然科学版),2008,36(7):93-96. 被引量:12
  • 3刘文君.Memetic算法研究与工程应用.博士学位论文,武汉:华中科技大学,2008.

二级参考文献6

  • 1曾洪鑫,宾鸿赞,张芬.多品种装配顺序的一种改进遗传算法[J].华中科技大学学报(自然科学版),2006,34(3):39-41. 被引量:2
  • 2蔡延光,师凯.带软时间窗的联盟运输调度问题研究[J].计算机集成制造系统,2006,12(11):1903-1908. 被引量:16
  • 3Lin S, Kernighan B W. An effective heuristic algo rithm for the traveling salesman problem[J]. Operations Research, 1973, 21: 498-516.
  • 4Moscato P, Norman M. A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems[C]//Proceedings of the International Conference on Parallel Computing and Transputer Applications. Amsterdam:IOS Press, 1992: 187-194.
  • 5Rochat Y, Taillard E D. Probabilistic diversification and intensification in local search for vehicle routing [J]. Journal of Heuristics, 1995, 1:147-167.
  • 6Kohl N, Desrosiers J, Madsen O B G, et al. 2- Path cuts for the vehicle routing problem with time windows[J]. Transportation Science, 1999, 33(1): 101- 116.

共引文献11

同被引文献14

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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