The Research Of Vehicle Routing Problem Based On Improved Shuffled Frog Leaping Algorithm

In the computer and engineering, economic management, intelligent transportation and so on, optimization problem is a common problem. Because of these realistic problems constantly driving, optimization problem has become a subject of experimental wide application and strong practicability. Researchers also has carried on the long-term unremitting discussion and research. Generally methods to solve optimization problem fall into two categories:the traditional algorithms and intelligent optimization algorithms.Shuffled frog leaping algorithm (SFLA) is a kind of new heuristic evolutionary algorithm, it has efficient computing performance and good global search ability. As a new type of bionic intelligent optimization algorithm, Shuffled frog leaping algorithm combines the advantages of memetic algorithm (MA) and particle swarm optimization algorithm (PSO).The algorithm is simple in concept and has strong global search optimization ability and speed computing. It adjusts to less parameters and easy to implement. Because of its unique advantages, shuffled frog leaping algorithm get more and more the attention, gradually becoming a kind of the effective ways and methods to solve the problem. However, it is a new algorithm of theoretical analysis and application research are at an early stage, the theoretical research is not thorough, application has significant limitations. Its theory and methods are subject to further development and perfection, is worth studying.In this article, mainly for the disadvantage of shuffled frog leaping algorithm is easy to premature convergence and search precision is not high, the specific contents are studied and improved, finally applies the improved algorithm to solve traveling salesman problem and capacitated vehicle routing problem.(1) Artificial simulated annealing algorithm is introduced into the local search of shuffled frog leaping algorithm, to improve the local search ability of the algorithm and avoid falling into local optimum. A modified shuffled frog leaping algorithm based on artificial simulated annealing algorithm is proposed, the results demonstrate the superiority of the improved algorithm.(2) Apply the improved algorithm to solve the traveling salesman problem. The paper simply describes the mathematical model and design philosophy, then applies the improved algorithm to solve traveling salesman problem, finally experiments show the feasibility and effectiveness of the improved algorithm.(3) Apply the improved algorithm to solve the capacitated vehicle routing problem. The paper simply describes the mathematical model and design philosophy, experiments show the feasibility and effectiveness of the improved algorithm.Finally, the thesis summarizes the full text comprehensively and systematically. And it puts forward the following research which need to be strengthened and improved.