Abstract
This paper focuses on improving the efficiency of the genetic algorithm, analysis the shortages of the algorithm at coding method and mutation operator and selected a TSP problem to simulate. First of all, the initial population was taken by order coding to speed up the algorithm convergence. In addition, the inversion operation and migration operation had been added into the mutation process. The experimental results show that without sacrificing convergence speed and the scale of population the improved algorithm has an extraordinary increase on optimal solutions and efficiency.
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.
