位置:成果数据库 > 期刊 > 期刊详情页
全局优化的了望算法
  • 期刊名称:广东工业大学学报.23(2).1~11,2006
  • 时间:0
  • 分类:O224[理学—运筹学与控制论;理学—数学]
  • 作者机构:[1]广东工业大学自动化学院,广东广州510090, [2]浙江大学工业控制技术国家重点实验室,浙江杭州310027
  • 相关基金:国家自然科学基金资助项目(60374062);广东省自然科学基金项目(04009488);广东省科技计划项目(2004810101038)
  • 相关项目:联盟运输调度问题研究
中文摘要:

提出求解全局优化问题的了望算法.了望算法利用了望技术确定群山最高点的常识,通过了望管理机制、了望点产生策略、局部问题构造与求解机制,能在较短的时间内求解全局优化问题.大量的测试表明,了望算法具有较高的收敛率和较强的获得问题全部解的能力,对初始点几乎没有依赖,参数选择简单.了望算法能够保证在迭代过程中迭代点的质量逐步变好,所提出的三层次记忆机制极大地提高了望算法的收敛速度.大量的对比测试也表明,在收敛率和全局搜索能力等方面了望算法较遗传算法有一定的优势,且在大多数情况下了望算法耗时较少.由于了望算法是根据人类的高级行为智能和推理智能提出的一种智能算法,它为解决全局优化问题开辟了一条新的途径.

英文摘要:

Outlook algorithm is presented to solve global optimization problems in this paper. Based on common knowledge that one decides the highest point of mountains by outlook, by employing supervision mechanism of outlook, strategies of generating outlook points and mechanisms of constructing and solving local problems, outlook algorithm can solve any global optimization problem in a relatively short time. A large number of tests show that outlook algorithm is of higher convergence ratio, stronger capacity to obtain all solutions of global optimization problems, little dependence on initial solution and simplicity in deciding its control parameters. It can be ensured that the quality of iterative points will gradually improve in the iterative process of outlook algorithm. The three-level memory mechanism of outlook algorithm greatly increases its convergence rate. A large number of contrast tests also show that outlook algorithm has advantage over genetic algorithm in convergence ratio and capacity of global search, and spends less time than genetic algorithm in most cases. Since outlook algorithm simulates human behavioral and inferential intelligence, it exploits a brand new way to solve global optimization problems.

同期刊论文项目
期刊论文 47 会议论文 1 获奖 4
同项目期刊论文