Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing

Abstract

The problem of finding the shortest path between two nodes is a common problem that requires a solution in many applications like games, robotics, and real-life problems. Since its deals with a large number of possibilities. Therefore, parallel algorithms are suitable to solve this optimization problem that has attracted a lot of researchers from both industry and academia to find the optimal path in terms of runtime, speedup, efficiency, and cost compared to sequential algorithms. In mountain climbing, finding the shortest path from the start node under the mountain to reach the destination node is a fundamental operator, and there are some interesting issues to be studied in mountain climbing that cannot be found in a traditional two-dimensional space search. We present a parallel Ant Colony Optimization (ACO) to find the shortest path in the mountain climbing problem using Apache Spark. The proposed algorithm guarantees the security of the selected path by applying some constraints that take into account the secure slope angle for the path. A generated dataset with variable sizes is used to evaluate the proposed algorithm in terms of runtime, speedup, efficiency, and cost. The experimental results show that the parallel ACO algorithm significantly (p < 0.05) outperformed the best sequential ACO. On the other hand, the parallel ACO algorithm is compared with one of the most recent research from the literature for finding the best path for mountain climbing problems using the parallel A* algorithm with Apache Spark. The parallel ACO algorithm with Spark significantly outperformed the parallel A* algorithm.

Parallel Adaptive Large Neighborhood Search based on Spark to solve VRPTW

“…Finally, the master node in Spark allocates the number of threads in the thread pool to execute the algorithm in parallel, and each thread carries a portion of the input to execute the algorithm. Algorithms similar to Genetic Algorithm 20,21 , Ant Colony Algorithm 22,23 ,and Simulated Annealing Algorithm 24 that have many iterations will be stored directly in memory using Spark, avoiding the storage of intermediate results, greatly reducing disk I/O processing, and improving the efficiency of the iterations.…”

Task Allocation of Heterogeneous Multi-Unmanned Systems Based on Improved Sheep Flock Optimization Algorithm

“…In addition, researchers have begun to apply various classic intelligent algorithms to the problem of task allocation in multi-unmanned systems and have made improvements to these algorithms [14][15][16][17]. Chen [4] proposed an improved double wolf pack search algorithm to address the task allocation problem.…”

Multi-objective path planning for mobile robot based on ACO -APF fusion algorithm

“…Gao Guanqiang, et al [4] proposed a new adaptive coordination ant colony optimization , to obtain an optimal solution for a group of robots performing geographically distributed tasks, the complex coupling between robot and task is considered in this algorithm. Alhenawi Esra' A, et al [5] proposed a parallel ant colony optimization algorithm to find the shortest climbing path, which guarantees the safety of the chosen path by introducing some constraint conditions considering the safe slope of the path. Tomitagawa Koki, et al [6] proposed an ant colony algorithm to find the optimal path of a garbage collection robot.…”