Multi-metaheuristic Optimization Algorithms for Effective Routing System

Abstract

One of the predominant problems that require great attention in the packet-switch network is finding the optimal routing path for packets movement. The problem leads to an increase in the size of the network, thereby making routing of the network becomes more difficult due to traffic congestion, delay, and time at which packets are delivered over the network. Hence, there is a need to develop an effective routing algorithm that can reduce congestion and time of packet delivery when transferring data over network nodes. This paper applied multi-meta-heuristic optimization algorithms to develop an enhanced routing system by application of three combined natured inspired metaheuristic algorithms; Ant Colony Optimization (ACO), Bat Algorithm, and Tabu Search to reduce the routing problems. Experimental results showed that the developed multi-metaheuristic routing system performed efficiently with 0.002E14s of delay time against the shortest time, 70MB packet size passed through the highest path and 9.4E14 s average delay time against the packet size.