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

一种改进的进化规划算法
引用本文:汪颖,钱伟懿. 一种改进的进化规划算法[J]. 运筹与管理, 2004, 13(4): 73-76
作者姓名:汪颖  钱伟懿
作者单位:渤海大学,数学系,锦州,121000
基金项目:辽宁省教育厅科学研究计划基金资助项目(2021401124)
摘    要:本对于全局优化问题提出一个改进的进化规划算法,该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向,以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性,而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题,数值结果表明本算法是可行的,有效的。

关 键 词:运筹学 全局优化 进化规划 随机搜索
文章编号:1007-3221(2004)04-0073-04
修稿时间:2003-10-13

An Improved Evolutionary Programming Algorithm
WANG Ying,QIAN Wei-yi. An Improved Evolutionary Programming Algorithm[J]. Operations Research and Management Science, 2004, 13(4): 73-76
Authors:WANG Ying  QIAN Wei-yi
Abstract:In this paper, an improved evolutionary programming algorithm for global optimization problem is proposed. In the algorithm, the direction of total force, which is based on electromagnetism theory, is received as its random search direction with the probability p, and the random search direction generated according to normal distribution is received with the probability 1-p. The improved algorithm not only overcomes the blindness of the random search for traditionally evolutionary programming algorithm, but also retains the quality of its global search. The algorithm is applied to several typical test examples. The numerical results show the improved evolutionary programming algorithm is feasible and efficient.
Keywords:operations research  global optimization  evolutionary programming  random search
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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