Routing Optimization Of Logistics Based On Improved Genetic Algorithm

With the rapid development of economy and society, the prominence of logistics activities is increasing. As the main part of the logistics activities, logistics and distribution scheduling problem has increasingly become a research focus for scholars. Vehicle routing problem is an important aspect of Logistics and Distribution. Vehicle routing problem generally refers that under a series of clients in need of service and some of vehicles, the question is to get the best vehicle travel routes which meet the objective of shortest mileage or the lowest total cost of transportation and so on, also some constraints of customer demand and shipments, vehicle load restrictions, travel time constraints and others are must be satisfied. Vehicle routing problem is a typical NP problem under which the optimal solution is hardly got by the traditional methods, so in this paper, a heuristic algorithm is used to solve the VRP.The paper analyzes the characteristics of the VRPTW in detail, confirms the basic conditions, and constitutes the model of the VRPTW. Then the paper researches the GA and the niche technology, and brings the niche technology into the GA and constructs the NGA. The GA and NGA are designed for computing an example of the VRPTW, and so the optimal solution is got, at the same time the results indicate the NGA is better than the GA and is a good method for the VRPTW. Finally, the paper makes the traffic as a restriction and brings into the VRPTW model, and constructs a model which is computed and proved be true of the fact question.