Metaheuristic Recursive Graph Routing based on Collective Intelligence Algorithms Inspired by Birds Behaviors

Abstract

In the realm of graph routing, various deterministic algorithms such as Floyd and Dijkstra have been instrumental in achieving specified goals. However, as graphs grow larger in size, the torch is being passed to meta-heuristic algorithms like genetics and particle swarm optimization. These innovative approaches address the challenges posed by extensive graphs, particularly in terms of routing time and loop prevention. Distance estimation and fitness functions have become pivotal elements in contemporary algorithms, significantly contributing to the reduction of route duration. Nonetheless, the persistent challenges of graph routing remain in handling loops and optimizing routing time efficiently. A groundbreaking solution to these challenges comes in the form of a novel algorithm inspired by the legendary bird, the Phoenix. In this algorithm, the history of nodes is inherited by their offspring. During each reproductive cycle, the algorithm ensures that the developed child, while fitting on offspring and selecting the stronger one, does not reintroduce itself to its own history, effectively preventing loops.