首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种改进的禁忌搜索算法及其在连续全局优化中的应用
引用本文:郭崇慧,岳晓晖.一种改进的禁忌搜索算法及其在连续全局优化中的应用[J].运筹与管理,2007,16(4):6-11.
作者姓名:郭崇慧  岳晓晖
作者单位:1. 大连理工大学,系统工程研究所,辽宁,大连,116024
2. 大连理工大学,应用数学系,辽宁,大连,116024
摘    要:禁忌搜索算法是一种元启发式的全局优化算法,是局部搜索算法的一种推广,已被成功地应用于许多组合优化问题中。本文针对有界闭区域上的连续函数全局优化问题,提出了一种改进的禁忌搜索算法,并进行了理论分析和数值实验。数值实验表明,对于连续函数全局优化问题的求解该算法是可行有效的,并且结构简单,迭代次数较少,是一种较好的全局启发式优化算法。

关 键 词:运筹学  元启发式算法  禁忌搜索算法  连续全局优化
文章编号:1007-3221(2007)04-0006-06
修稿时间:2007-03-02

An Improved Tabu Search Algorithm for Continuous Global Optimization Problems
GUO Chong-hui,YUE Xiao-hui.An Improved Tabu Search Algorithm for Continuous Global Optimization Problems[J].Operations Research and Management Science,2007,16(4):6-11.
Authors:GUO Chong-hui  YUE Xiao-hui
Institution:1. Institute of Systems Engineering, Dalian University of Technology, Dalian 116024, China; 2. Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China
Abstract:Tabu search algorithm is a meta-heuristic global optimization algorithm,which has been successfully applied to a variety of combination optimization problems.This paper proposes an improved memory-based tabu search algorithm,which is applied as an approach to solve continuous function optimization on closed bounded region.The proposed algorithm is very simple and easy to implement.Numerical results illustrate that this algorithm is feasible,effective,and very suitable for continuous global optimization.
Keywords:operations research  meta-heuristic algorithm  tabu search algorithm  continuous global optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号