Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (35): 53-55.DOI: 10.3778/j.issn.1002-8331.2008.35.016

• 理论研究 • Previous Articles     Next Articles

Looking-forward dynamic encoding algorithm for searching

YANG Cheng,LI Yuan-xiang,LIN Zhi-yi   

  1. State Key Laboratory of Software Engineering,Wuhan University,Wuhan 430072,China
  • Received:2007-12-25 Revised:2008-03-04 Online:2008-12-11 Published:2008-12-11
  • Contact: YANG Cheng

前瞻动态编码搜索算法

杨 程,李元香,林志毅   

  1. 武汉大学 软件工程国家重点实验室,武汉 430072
  • 通讯作者: 杨 程

Abstract: A method named look forward dynamic encoding algorithm is proposed for globalizing and improving the Dynamic Encoding Algorithm for Searches(DEAS) method which is used to solve the global optimization problem with high-performance.The basic structure of the method is a binary matrix.It includes two master procedures-bisection search and unidirectional search.The new method is inspirited by the idea of widening the visual field.The results of numerical simulations depict that the proposed algorithm is effective in nonlinear and discontinuous functions.

Key words: global optimization, Dynamic Encoding Algorithm for Searching(DEAS), look-forwarding method

摘要: 动态编码搜索算法快速高效的求解全局优化问题。算法基本结构是二进制矩阵,它包括对分搜索和单向搜索两个基本过程。针对算法容易陷入局部最优的问题,提出一种改进的全局优化算法:前瞻算法。前瞻算法基于扩大视野、全局把握的思想。测试例子的结果表明,与动态编码搜索算法相比前瞻算法具有较强的跳出局部最优的能力,对高度非线性、强振荡的函数优化问题,具有更强的适应性。

关键词: 全局优化, 动态编码搜索算法, 前瞻算法