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

一种求解约束优化问题的信赖域微粒群算法
引用本文:李金莱,卢香清. 一种求解约束优化问题的信赖域微粒群算法[J]. 计算机工程与应用, 2011, 47(10): 54-55. DOI: 10.3778/j.issn.1002-8331.2011.10.015
作者姓名:李金莱  卢香清
作者单位:南阳师范学院 计算机与信息技术学院,河南 南阳 473061
摘    要:提出了一种改进型信赖域微粒群算法来求解带有不等式约束优化问题。粒子群每一次进化后,对所有粒子执行信赖域搜索,寻找更优个体,从而增加了微粒群算法的局部搜索能力。把算法应用于供应商补货优化,实验结果表明,该方案能够有效地减少供应商的补货成本,具有较好的应用价值。

关 键 词:信赖域  微粒群算法  供应商补货策略  
修稿时间: 

Novel trust region particle swarm optimization algorithm for solving constrained optimization problems
LI Jinlai,LU Xiangqing. Novel trust region particle swarm optimization algorithm for solving constrained optimization problems[J]. Computer Engineering and Applications, 2011, 47(10): 54-55. DOI: 10.3778/j.issn.1002-8331.2011.10.015
Authors:LI Jinlai  LU Xiangqing
Affiliation:College of Computer & Information Technology,Nanyang Normal University,Nanyang,Henan 473061,China
Abstract:A novel trust region Particle Swarm Optimization(PSO) algorithm is proposed for solving constrained optimization problems.After particle swarm evolving each time,the trust domain search is implementing for all the particles to find better individuals,thereby the capabilities of particle swarm local searching is enhanced.The test experiments for the replenishment strategy of supplier show that the proposed solution can effectively reduce the cost of the supplier replenishment,and has good application value.
Keywords:trust region  Particle Swarm Optimization(PSO)algorithm  replenishment strategy of supplier
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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