A Hybrid Metaheuristic Based Approach for Solving Optimization Problem

Abstract

The ant colony optimization is a technique which is used in order to find path from the graph with optimality. The ant colony optimization (ACO) found its application in the area of operation research. In addition, there also exists honey bee optimization algorithm. Travelling Salesman Problem (TSP) is about finding a Hamiltonian path with minimum cost. The problem with ACO is that the shortest path is located by moving through region of other paths. Also, they move in shorter distances only. The Honey bee on the other hand can move in any direction and cover more distances also. In the proposed technique collaboration of Honey bee and ACO techniques are made to form hybrid approach to improve the effectiveness of load balancing and cloud scheduling to solve the problem of travelling salesman problem. The proposed technique will take into consideration advantages of both the techniques to form hybrid approach. The simulation is conducted in MATLAB and it suggests optimal result as comparison to individual ant colony and honey bee algorithm.