计算机工程与设计
計算機工程與設計
계산궤공정여설계
COMPUTER ENGINEERING AND DESIGN
2010年
9期
2005-2009,2139
,共6页
自组织%学习机制%高维空间%遗传算法%模拟退火%禁忌搜索
自組織%學習機製%高維空間%遺傳算法%模擬退火%禁忌搜索
자조직%학습궤제%고유공간%유전산법%모의퇴화%금기수색
self-organizing%learning principle%hyper-space%genetic algorithm%simulated annealing%Taub search
提出了一种有别于当前优化算法框架的自组织学习算法(self-organizing learning algorithm,SLA),该算法融合遗传算法并行搜索与模拟退火串行搜索,结合粒子群学习机制和禁忌搜索机制,实现了系统与环境的交互学习,能够很好地处理传统优化方无法应对的高维非线性优化问题.SLA分自学习和互学习两个智能化学习阶段,先进行基于自学习机制的邻域禁忌搜索,保证局部极值的收敛,然后通过信息共享平台,进行基于互学习机制的广域禁忌搜索,保证全局极值的收敛.系统通过与环境交互学习而自适应地调整搜索策略和相关参数,使得搜索过程能够有效地避免盲目性,而具有相当的自组织性.最后,通过高维测试函数的对比仿真实验表明,SLA在由小型低维空间转入超大型高维空间时,仍能够与环境保持稳定,透明的交互学习,其全局搜索能力和整体稳健性明显优于其它搜索方法.
提齣瞭一種有彆于噹前優化算法框架的自組織學習算法(self-organizing learning algorithm,SLA),該算法融閤遺傳算法併行搜索與模擬退火串行搜索,結閤粒子群學習機製和禁忌搜索機製,實現瞭繫統與環境的交互學習,能夠很好地處理傳統優化方無法應對的高維非線性優化問題.SLA分自學習和互學習兩箇智能化學習階段,先進行基于自學習機製的鄰域禁忌搜索,保證跼部極值的收斂,然後通過信息共享平檯,進行基于互學習機製的廣域禁忌搜索,保證全跼極值的收斂.繫統通過與環境交互學習而自適應地調整搜索策略和相關參數,使得搜索過程能夠有效地避免盲目性,而具有相噹的自組織性.最後,通過高維測試函數的對比倣真實驗錶明,SLA在由小型低維空間轉入超大型高維空間時,仍能夠與環境保持穩定,透明的交互學習,其全跼搜索能力和整體穩健性明顯優于其它搜索方法.
제출료일충유별우당전우화산법광가적자조직학습산법(self-organizing learning algorithm,SLA),해산법융합유전산법병행수색여모의퇴화천행수색,결합입자군학습궤제화금기수색궤제,실현료계통여배경적교호학습,능구흔호지처리전통우화방무법응대적고유비선성우화문제.SLA분자학습화호학습량개지능화학습계단,선진행기우자학습궤제적린역금기수색,보증국부겁치적수렴,연후통과신식공향평태,진행기우호학습궤제적엄역금기수색,보증전국겁치적수렴.계통통과여배경교호학습이자괄응지조정수색책략화상관삼수,사득수색과정능구유효지피면맹목성,이구유상당적자조직성.최후,통과고유측시함수적대비방진실험표명,SLA재유소형저유공간전입초대형고유공간시,잉능구여배경보지은정,투명적교호학습,기전국수색능력화정체은건성명현우우기타수색방법.
Traditional optimization methods are unable to deal with the multidimensional non-linear optimization problem which involves a great number of discrete variables and continuous variables.In order to cope with this situation,a self-organizing learning algorithm (SLA)is proposed,in which the parallel search strategy of genetic algorithm and the serial search strategy of simulated annealing algorithm ale involved.Additionally,the learning principle of particle swarm optimization and the tabu search strategy are involved in the SLA,wherein the integrated frame work is different from the traditional optimization methods and the interactive learning strategy is involved in the process of random searching.The SLA is divided into two handling courses:self-learning and interdependent-learning.The local optimal solution will be achieved through the self-learning in the process of local searching and the globally optimal solution will be achieved via the interdependent learning based on the mechanism for information sharing.The search strategy and controlled parameters of the SLA are adaptively fixed according to the feedback information from interactive learning with the environment,thus the SLA is selforganizing and intelligent.Experiments for the multidimensional test functions show that SLA is superior to other optimization methods.