Research On Optimization Of Distribution Path Based On Genetic Algorithm And Combinatorial Strategy

Distribution routing problem is a topic of great concern in manufacturing andlogistics industry. When solve the distribution optimization problem, the first task isto determine solving strategies and methods. In recent years, a large number ofEnterprises and scholars have conducted a large number of exploration to solvedistribution route optimization problem. Genetic algorithm has good flexibility androbustness to solve path optimization, its theoretical and practical application alsoachieved great success.This paper researches the problems that have a lot of customers but smalldemand. The target is to find the optimal path that delivery vehicles cost least.Analysis this problem based on vehicle routing problem and traveling salesmanproblem, this paper discusses the problem that distribution to multiple customers, putforward the optimization of combinatorial strategy. Solve the problem with severalsteps by using the basic ideas of dynamic programming.(1)This paper selected the strategy to solve the optimal path problem. When usethe optimization of combinatorial strategy to solve the problem of distribution path, itcan reduce the complexity of the search, determine the number of minimumrequirements vehicle and the order of distribution, and find the best path. Illustratingthe feasibility and reliability that the strategy to solve the problems.(2)Genetic algorithm is selected as a method to solve the problem The geneticalgorithm is used solving the optimization problem has good adaptability, and Geneticoperator have very strong plasticity. Changing Genetic operator for the specificproblems adapt to some kinds of distribution routing optimization.(3)According to the path optimization problem in the distribution center of aHangzhou manufacturing enterprise to establish the mathematical model, and use the improved genetic algorithm to solve the problems. Use MATLAB to do a simulation,attest the reliability of population pretreatment operator and mutation operator.To manufacture enterprise, structure the pretreatment operator and mutationoperator according to optimization of distribution path mathematical model and thepath search problem. Mathematical model of manufacturing enterprise hasadaptability and generality in the optimization of distribution path. Using thepretreatment operator to make the illegal solution become effective solution, improvethe success rate of the search.