...
首页> 外文期刊>Journal of Computers >Solving Location Problem of Distribution Center Based on Hybrid Particle Swarm Algorithm
【24h】

Solving Location Problem of Distribution Center Based on Hybrid Particle Swarm Algorithm

机译:基于混合粒子群算法的分配中心解决位置问题

获取原文
           

摘要

A kind of coding is constructed for location problem of distribution center and then a hybrid particle swarm optimization algorithm is proposed, integrating the particle swarm optimization and the hill climbing algorithm. The particle swarm evolves in the integer space after being integer standardized. This algorithm can solve the problem of low precision and divergence of basic particle swarm optimization algorithm, so it has higher efficiency of search. Compared with basic particle swarm optimization algorithm and genetic algorithm, it has been proved that this algorithm is more effective.
机译:一种编码被构造用于分配中心的位置问题,然后提出了一种混合粒子群优化算法,集成了粒子群优化和山爬算法。在整数标准化之后,粒子群在整数空间中发展。该算法可以解决基本粒子群优化算法的低精度和分歧的问题,因此它具有更高的搜索效率。与基本粒子群优化算法和遗传算法相比,已经证明该算法更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号