Abstract
Genetic algorithms all the methods used to solve the Traveling Agent (TSP) problem, the use of genetic algorithms on TSP problems is more common than other methods, and it is also possible to achieve global search and obtain the best values. Compared with the traditional genetic algorithm, the particle swarm algorithm is not only easy to be applied, but also can be widely used because of the function of rapid search, but at the same time, the shortcomings of the traditional standard particle swarm algorithm are more prominent, and it is easy to fall into the situation of optimal solution of local problems. So first of all, we use the classical TSP algorithm to propose a mixed particle swarm algorithm, which solves the TSP problem by using the selection, crossover, variation and other operators of the traditional genetic algorithm, and through the conclusion of the solution, it can be shown that the method not only greatly improves the search function of the traditional standard particle swarm, but also greatly improves the convergence speed while obtaining the approximate optimal solution.
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.