【24h】

Particle Swarm Optimization in Solving Vehicle Routing Problem

机译:粒子群算法求解车辆路径问题

获取原文
获取外文期刊封面目录资料

摘要

The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operational research.But traditional methods might suffer from slow convergence and the curse of large sizes,heuristicsbased swarm intelligence can be an efficient alternative.Particle swarm optimization(PSO)is known to effectively solve engineering optimization problems.In this paper,the PSO in solving VRP is comprehensive surveyed from two basic aspects:the improved PSO algorithms and the particle encoding method.For each application,technical details that are required are all discussed.Finally,a summary is given together with suggestions for future research.
机译:车辆路径问题(VRP)是一个NP完全问题,也是运筹学中的热门话题。但是传统方法可能会遇到收敛速度慢和大范围诅咒的问题,基于启发式的群体智能可能是一种有效的替代方法。 (PSO)可以有效解决工程优化问题。本文从改进的PSO算法和粒子编码方法两个基本方面对解决VRP的PSO进行了全面的综述。对于每种应用,都需要技术细节最后,给出了总结以及对未来研究的建议。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号