Abstract
Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NP-Complete class of problems. Four approaches based on genetic algorithms to solve this problem are presented in this article. The first three algorithms proposed use crossover mechanisms between pairs of solutions based on their intersecting regions and the fourth one uses a mutation mechanism on individual solutions, in which the perturbation applied depends on the state of the system. Simulation experiments have been carried out to validate the distinct approaches, which reveal their good performance and provide hints for their application in robotics, packet networks and other fields.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.