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

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 prob...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 11; pp. 6185 - 6196
Main Authors:	Alhenawi, Esra'a, Khurma, Ruba Abu, Sharieh, Ahmad A., Al-Adwan, Omar, Shorman, Areej Al, Shannaq, Fatima
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms ant colony Ant colony optimization Apache spark Cluster computing Costs Heuristic algorithms Mountain climbing Mountains Optimization parallel algorithm Parallel algorithms Path planning path-finding problem Program processors Robotics Run time (computers) Search problems Shortest-path problems Sparks
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!