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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 11; s. 6185 - 6196
Hlavní autoři:	Alhenawi, Esra'a, Khurma, Ruba Abu, Sharieh, Ahmad A., Al-Adwan, Omar, Shorman, Areej Al, Shannaq, Fatima
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!