A Hybrid Genetic-Ant Colony Optimization Algorithm for the Optimal Path Selection

The shortest path problem lies at the heart of network flows that seeks for the paths with minimum cost from source node to sink node in networks. This paper presents a hybrid genetic-ant colony optimization algorithmic approach to the optimal path selection problem. First, some existing solutions for the optimal path selection problem are analyzed, and some shortages and flaws are pointed out. Second, the data organization method for road network based on the graph theory is proposed. Furthermore, the optimal path selection algorithm integrated of sinusoidal probability transfer rules, pheromone update strategy and dual population is presented. Finally, the experimental results show that the proposed algorithm speeds up the convergence rate and improves the efficiency.