Study Of Algorithms For Vehicle Routing Problem

The object of logistics is to satisfy the requirement of consumer with least cost. Logistic delivery vehicle routing problem is a pivotal problem to logistic system optimization .The exact and rational planning of vehicle routing in distribution will reduce rate of empty driving , lower cost of distribution and take great effect on the efficiency.Vehicle routing problem is not only a typical combination optimization restrained but also a NP hard problem. Traditional algorithms include exact procedures and heuristics. Because saving heuristic algorithms is simple and easy to be comprehended, lots of other algorithms are constructed based on it. Genetic algorithm is a self-adaptability search method. It is especially fit for combination optimization. Many scholars believe that it is the current of solving NP hard problem.The Vehicle routing problem in this paper request all consumers will be served in a time, we call it vehicle routing problem with wide time window. Based on reading lots of correlate papers, the author modify saving heuristic algorithm and genetic algorithm constructed to solve vehicle routing problem with wide time window. Furthermore, a new algorithm is constructed in this paper which combines saving heuristic algorithm and genetic algorithm. We call it genetic-saving hybrid algorithm.Genetic-saving hybrid algorithm constructed in this paper is a double -deck pseudo-parallel structure. It makes the best of search methods in different fields. Exemplifications prove that this algorithm enhance capability of optimization , solving efficiency and reliability of running. Genetic-saving hybrid algorithm count for academic research and appliance in practice.