• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Electronics, Control, Optimization and Computer Science >The Ant-Step Algorithms: Reloading the Ant System Heuristic and the Overlooked Basic Variants
【24h】

The Ant-Step Algorithms: Reloading the Ant System Heuristic and the Overlooked Basic Variants

机译：蚂蚁算法：重新加载Ant System启发式和忽略的基本变体

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Thirty years ago, an heuristic based on the social ants behavior was proposed, to tackle the Traveling Salesman Problem (TSP) called Ant System (AS) or Ant Algorithm (AA). In a pure experimental context, two choices were explored to implement this heuristic. In the first choice, ants, as in nature, autonomously, move and update pheromones. When in the second, ants update pheromones, simultaneously, after fulfilling an entire circuit, in an "abnormal" ants' attitude, defining the Ant-Cycle variant. The first choice offers two options: considering distances between towns, to define the Ant-Quantity variant or not, defining the Ant-Density variant. Exploiting global information in the AS, the Ant-Cycle variant was the most performing, consequently, any improvement of AS was defined upon this best variant.An unexplored "overlooked" third choice was possible and promising; which consist to push more deeper the "abnormal" ants' attitude, forcing them to update pheromones, simultaneously, after every single move, providing the Ant-Step model. This third choice offers, also, the option of considering distances or not.The aim of this paper is to "reload" the Ant Algorithms and define a new AS basic algorithms: the Ant-Step-Quantity and the Ant-Step-Density. These new variants will be validated through an experimental study on various symmetric TSP benchmarks and compared to the previous three basic ones.
机译：三十年前，提出了一种基于社会蚂蚁行为的启发式，以解决一个名为Ant System（AS）或Ant算法（AA）的旅行推销员问题（TSP）。在纯粹的实验背景下，探索了两种选择来实施这种启发式。在第一选择，蚂蚁，如同自然，自主，移动和更新信息素。当在第二时，蚂蚁更新信息素，同时在满足整个电路之后，以“异常”蚂蚁的姿态，定义蚂蚁循环变量。第一选择提供了两种选择：考虑城镇之间的距离，以定义蚂蚁量变量，定义蚂蚁密度变体。在AS中利用全局信息，蚂蚁周期变体最具表现，因此，任何改进都在这一最佳变体上定义了。未开发的“被忽视”的第三种选择是可能的，有前景;它包括推动更深的“异常”蚂蚁的态度，强迫他们同时更新信息素，在每一次移动之后，提供蚂蚁步骤模型。该第三选择提供，也是考虑距离的选择。本文的目的是“重新加载”蚂蚁算法并将新的作为基本算法定义：蚂蚁数量和蚂蚁级密度。这些新变种将通过对各种对称TSP基准测试的实验研究进行验证，并与前三个基本基本进行验证。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号