.png){kind=icon}
返回
Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2822824.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a niching Pareto ant colony optimization (NPACO) algorithm to solve the bi-objective pathfinding problem. First, based on a planar navigable data model, three different searching area restricted methods are proposed and compared. In addition, a node simplification strategy is introduced to simplify nodes that exist in network branch loops, eliminating the redundant search time in the branch loops. Afterward, we propose the elitist ants and weakened strategy for an ACO to overcome the problem caused by the impact of accumulated pheromone on the suboptimal path and apply the strategy to a PACO for urban city pathfinding. Finally, the niching method is adopted to simultaneously locate and maintain multiple optimal solutions to increase search robustness. The experimental results show that the NPACO with a restricted and simplified search area returns a Pareto optimal solution set that is uniformly distributed along the Pareto frontier with low computational complexity.
Keyword:
Pathfinding problem
Ant colony optimization
Pareto optimal solution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Experimental evidence on the effect of incentives and domain in risk aversion and discounting tasksOAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
A novel multi-zone reactive power market settlement model: A pareto-optimization approach.png)
ENERGY
ENERGYIF9.4
PREAI
分享收藏
查看更多内容