The Research Of The Open Vechicle Routing Problem Based On Tabu Search Algorithm

Along with the integrative development of the economy, the logistics has been an important component of business activities for a corporation. Distribution is an important part of the transport logistics. In the transport distribution, how to reasonably deal with vehicle delivery routes, reduce the transport costs, and improve the economic efficiency has become an important goal of distribution. In the paper, the main content of research is the related issues of the Open Vehicle Routing Problem in logistics distribution, which includes the following sections.Firstly, in the paper we briefly introduce the conception of the logistics and distribution, and present the Open Vehicle Routing Problem in the logistics distribution. For the Open Vehicle Routing Problem, we describe the problem in detail and analysis the characteristic of it. At the same time, for the research at home and broad of the different types of the Open Vehicle Routing Problem, we conduct in-dept analysis and particular exposition. Besides, we introduce the Tabu search algorithm, and describe the flow of it in detail and analysis each of important elements.Secondly, in the Open Vehicle Routing Problem, the type of vehicles is same, the demand of client is not split and only is completed by a vehicle once, all of these bring on that the rate of the empty capacity of vehicle is higher and cause a waste of vehicle resources. Because of these, the paper puts forward the Split Delivery Open Vehicle Routing Problem with Heterogeneous Vehicles. We particularly describe the problem and construct the mathematical model according to the characteristic of it on the basis of integer programming, and solve the problem by means of Tabu search algorithm. Meantime, we improve the generation of the initial solution and neighborhood structure in the Tabu search algorithm. By a lot of simulation experiment on examples on solving the Split Delivery Open Routing Problem with Heterogeneous Vehicles by means of Tabu search algorithm, we validate the validity of the mathematic model. The computational results are provided and compared with the traditional Open Vehicle Routing Problem, which indicates that the result is satisfying.Finally, on the basis of the Open Vehicle Routing Problem and Tabu search algorithm, the paper puts forward a Multi-Start Tabu search algorithm in allusion to the deficiency of that the Tabu search algorithm strongly depends on the initial solution and the search process is generally started only from an initial solution, and use it to solve the Open Vehicle Routing Problem with Time Windows. By the experimenting on the normal test examples, the result shows that the algorithm achieved good result and has certain advantages.