Abstract
AbstractThe 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
