检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周鲜成[1] 赵志学[1] 贺彩虹[2] 徐戈[2]
机构地区:[1]湖南商学院计算机与电子工程学院,湖南长沙410205 [2]湖南商学院会计学院,湖南长沙410205
出 处:《中南大学学报(自然科学版)》2010年第2期623-627,共5页Journal of Central South University:Science and Technology
基 金:湖南省科技计划项目(2009GK3054);湖南省教育厅重点科研项目(09A048)
摘 要:针对现有算法在求解二级分销网络模型时计算量大、难以适用于求解大型规划问题和易陷入局部最优等不足,提出一种求解二级分销网络模型的混合微粒群算法。该算法以二级分销网络的总成本作为适应度函数,采用一种精简的编码方式,通过将遗传算法的变异和交叉操作引入微粒群算法,实现二级分销网络模型的离散优化。算例仿真结果表明:采用提出的算法能获得全局最优解,且收敛性好,运算速度快,稳定性好,能有效避免算法的早熟收敛问题。Based on the fact that there are large calculation, difficulty of solving large programming problems, and possibility of falling into local optimum, a mixed-particle swarm optimization was proposed to solve such disadvantages of two-level distribution network model. The proposed algorithm took the total cost of two-level distribution network as the fitness function, and a streamlined encoding was applied. The particle swarm optimization was combined with the mutation and crossover operations of the genetic algorithm in the proposed algorithm to realize the discrete optimization of two-level distribution network model. The simulation results show that the proposed algorithm can effectively avoid the premature convergence, have the access to the global optimal solution, and can enhance efficiency of algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166