首页> 外文会议>International Conference on Electrical Engineering and Informatics >A Review of Firefly Algorithms for Path Planning, Vehicle Routing and Traveling Salesman Problems
【24h】

A Review of Firefly Algorithms for Path Planning, Vehicle Routing and Traveling Salesman Problems

机译:萤火虫算法的路径规划,车辆路线和旅行商问题的综述

获取原文

摘要

This paper reviews the firefly algorithm and its implementation on path planning problems, vehicle routing problem and traveling salesman problem. Swarm Intelligence is an intelligence based on collective behavior in decentralized systems. One of the algorithms based on swarm intelligent is the firefly algorithm. Firefly algorithm is widely used to solve optimization problems. Many researchers share developed the standard firefly algorithm to solve the problems encountered due to the different characteristics of the problem. This condition raises several terms for the new algorithm, namely Modified Firefly Algorithm, Adaptive Firefly Algorithm, Discrete Firefly Algorithm, and Hybrid Firefly Algorithm. We explored different firefly algorithm to solve their common characteristics the path planning, vehicle routing problem, and traveling salesman problem which are path, time and distance optimization.
机译:本文综述了萤火虫算法及其在路径规划,车辆路径问题和旅行商问题上的实现。群智能是一种基于分散系统中集体行为的智能。基于群智能的算法之一是萤火虫算法。 Firefly算法被广泛用于解决优化问题。许多研究人员共同开发了标准萤火虫算法,以解决由于问题的不同特征而遇到的问题。这种情况为新算法提出了几个术语,分别是改进的萤火虫算法,自适应萤火虫算法,离散萤火虫算法和混合萤火虫算法。我们探索了不同的萤火虫算法来解决它们的共同特征,即路径规划,车辆路径问题和旅行商问题,例如路径,时间和距离优化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号