马力, 刘丽涛. 万有引力搜索算法的分析与改进[J]. 微电子学与计算机, 2015, 32(9): 76-80. DOI: 10.19304/j.cnki.issn1000-7180.2015.09.015
引用本文: 马力, 刘丽涛. 万有引力搜索算法的分析与改进[J]. 微电子学与计算机, 2015, 32(9): 76-80. DOI: 10.19304/j.cnki.issn1000-7180.2015.09.015
MA Li, LIU Li-tao. Analysis and Improvement of Gravitational Search Algorithm[J]. Microelectronics & Computer, 2015, 32(9): 76-80. DOI: 10.19304/j.cnki.issn1000-7180.2015.09.015
Citation: MA Li, LIU Li-tao. Analysis and Improvement of Gravitational Search Algorithm[J]. Microelectronics & Computer, 2015, 32(9): 76-80. DOI: 10.19304/j.cnki.issn1000-7180.2015.09.015

万有引力搜索算法的分析与改进

Analysis and Improvement of Gravitational Search Algorithm

  • 摘要: 原始的融合粒子群算法的万有引力算法PSOGSA,主要解决连续优化问题.但实际中有很多优化问题都是离散的,比如调度问题、Web服务选择问题和路由选择问题.为解决工程实际中众多的组合优化问题,对原始PSOGSA进行改进,提出了DBPSOGSA算法,该算法对基准函数的测试结果表明了该方法的有效可行性.

     

    Abstract: The original hybrid optimization algorithm Hybrid Particle Swarm Optimization and Gravitational Search Algorithm PSOGSA is well suited for problems with continuous search space. However, there are many practical problems,which are discrete optimization problems such as scheduling, web services selection and routing problems.In order to solve numerous of practical engineering combinatorial optimization problems,made improve on the original PSOGSA proposed a novel hybrid optimization algorithm called DBPSOGSA,The algorithm test results on benchmark functions show that the effective feasibility of the method.

     

/

返回文章
返回