A Study On Unpaired Vehicle Routing Problem With Pickup And Delivery Based On Artificial Bee Colony Algorithm

Vehicle Routing Problem (VRP) is typical combination optimization problem in the field of operations research, and it is the hot issue in the enterprises logistics and distribution systems. As the logistics service level for people is higher and higher, the models of Vehicle Routing Problems are becoming more and more complicated. So, to perfect the field of Vehicle Routing Problem based on the classical VRP, and construct solution algorithms with high quality and high efficiency is very necessary and significant to improve the transportation efficiency and reduce the transportation cost of the enterprises.Based on the classical VRP, this paper studies one VRP model that is very significant but attracts little attention——Unpaired VRPPD, employing combination optimization algorithm and intelligent heuristic algorithm. The main contents are as follows. Firstly, the research background and signification of Unpaired VRP are introduced. The current research of VRPPD and artificial bee colony algorithm are analyzed, and the shortage of them is also pointed out. The main contributes and creative points of this paper are also introduced. Secondly, the general definition of VRP is described in detail, including the model, classification and component, and so on. Some classical algorithms are introduced in this section. All of these lay good foundation for the following research. Thirdly, based on the shortcoming in the algorithm, this paper improve artificial bee colony algorithm by improving the search operator and selection strategy. The test results show that the improved artificial bee colony algorithm enhance the performance. Fourthly, the definition and mathematical model of Unpaired VRPPD are described in detail. According to the characteristics of this problem, some strategies are proposed, just like the new methods for generating initial solution and the local search method, and finally the whole optimization algorithm based on artificial bee colony algorithm is presented. Comparing with GGA, the results show that the algorithm in this paper is better than GGA, and it is efficient and reasonable. The better routes schemes are described.This paper solved Unpaired VRPPD problem by artificial bee colony algorithm, and effectively expanded the research field of vehicle routing problem, and enriched the relevant algorithm.