Abstract
Search for optimal route from source to destination is a well-known optimization problem and lot of good solutions like Dijkstra algorithm, Bellman-Ford algorithm etc. are available with practical applications. But simultaneous search for multiple semioptimal routes are difficult with the above mentioned solutions as they produce the best one at a time. Genetic algorithm (GA) based solutions are currently available for simultaneous search of multiple routes. But the problem in finding multiple routes is that the selected routes resemble each other i.e., partly overlap. In this paper a GA based algorithm with a novel fitness function has been proposed for simultaneous search of multiple routes avoiding overlapping. Using a portion of real road map the simulation of the proposed algorithm and other currently available algorithm are done. The simulation results demonstrate the effectiveness of the proposed algorithm over other algorithms.
Sign-in/Register to access full text options 
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.
