检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工程大学理学院,哈尔滨150001 [2]哈尔滨工程大学自动化学院,哈尔滨150001
出 处:《应用数学学报》2012年第6期1018-1029,共12页Acta Mathematicae Applicatae Sinica
基 金:黑龙江省自然科学基金(F200931)资助项目
摘 要:光线寻优算法是一种通过模拟光的传播路径进行寻优的最优化方法.该算法用网格划分可行域,将具有不同折射率的介质填充到各网格中,并将光在此变折射率介质中的传播路径设想成算法的寻优路径.光线寻优算法仅用到目标问题的函数值,结构简单容易实现.根据费马原理,利用变分法进行推导,得出了光具有偏向折射率增大方向,偏离折射率减小方向的自动寻优性质.通过求解9个标准测试函数,并将算法与模拟退火算法,标准粒子群算法进行比较,验证了所得结论以及算法的可行性,有效性,潜在的优越性.Light ray optimization algorithm is an optimal method simulating the propagation path of light. In this algorithm, feasible region is divided by grids in which media with different refracitivities are put. Let the velocity of light rays in each medium be the value of objective function at some gate in these media with the point in the division, and then laws of refraction and reflection a beam of light rays propa- to search the optimal value automatically. Refraction and reflection merely occur on the boundary of grids, and light rays propagate along straight lines in the same grid. Only the function values of objective problem are used in light ray optimization, and it has the advantages of simple structure, few tuning parameters and easy tuning. According to Fermat's principle and variational method, the conclusions were reached that light will get closer to the direction that makes refractivity increase, and get further from the one that makes it decrease. The conclusions of light ray optimization were verified by solving nine standard test functions, and the algo- rithm also was compared with simulated annealing algorithm and standard particle swarm optimization algorithm. Feasibility, validity and potential advantages of the algorithm were verified by large quantity of numerical experiments.
关 键 词:光线寻优算法 光线方程 寻优机理 方向导数 曲率
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.145.54