摘要
针对简单小世界算法在优化复杂函数时出现的停滞现象,提出对搜索进行跟踪、对停滞节点进行更替的策略.对每个搜索节点,从搜索的第1代开始进行跟踪,记录节点在每个传递位置停留的次数,当停滞次数超出设定值时便认为该节点进入停滞状态,在搜索空间中随机生成一个节点替代该停滞节点,以保证搜索的高效性.仿真试验表明,改进算法有效地克服了原算法的停滞现象,与原算法相比,改进算法种群多样性好、优化效率高、鲁棒性强,并具备解决更复杂工程优化问题的潜能.
When simple small world algorithm is adopted to optimize complex functions, the searching nodes are prone to be trapped in these local optimums. Aiming at the above, the following strategy is suggested： adding the tracking and replacing mechanism to every searching node; counting the stagnation times of a node at a certain station in its searching route; if the times oversteps the allowable value, a new node randomly arises in the solution space to replace the stagnating one for improving the searching efficiency. The improved method is tested via a few benchmark test functions in a simulation and the corresponding results show the efficiency for solving stagnation. Compared with the simple small world algorithm, the modified small world algorithm is endowed with better robustness and faster convergence to solve complex optimization problems.
出处
《西安交通大学学报》
EI
CAS
CSCD
北大核心
2007年第11期1360-1363,共4页
Journal of Xi'an Jiaotong University
基金
国家自然科学基金资助项目(50505034)
关键词
小世界算法
停滞
跟踪
替代
small world algorithm
stagnation
tracking
replacing
