Research On Vehicle Routing Optimization Problems With Reverse Logistics In B2C E-Commence

With the rapid development of B2C E-commence, online shopping has increasedyear by year in the proportion of total retail sales of social consumer goods, so thecompetition between B2C E-commence enterprises becomes bigger. It is commonlybelieved that the logistics is“The Third Profit Source”for enterprises, if an enterprisewants to obtain greater economic benefits, the logistics distribution should beimproved. However, with the enhancement of the consciousness of the consumers’safeguarding rights, the quantities of returned purchase become much more and more,in order to reduce the loss caused by returned purchase, the enterprises are forced todevelop the reverse logistics and perfect the positive logistics at the same time. Beaimed at the B2C E-commerce’s business pattern, this paper discusses the vehiclerouting problems with simultaneous delivery and pickup on the basis of introducingthe vehicle routing problem, and gives algorithms to solve these problems.In chapter 1, this thesis introduces the background of vehicle routing optimizationproblems with reverse logistics in B2C E-commence, reviews the vehicle routingproblem with simultaneous deliveries and pickups (VRPSDP), and presents the maincontents of it. In chapter 2, the thesis briefly introduces the concept of B2CE-commence and the reverse logistics as well as the vehicle routing problem and thesolving methods for it. In chapter3, it studies VRPSDP with multi-distribution centersand considers the driving costs and the setup charges at the same time. In chapter 4,the thesis increases the time window constrains on the basis of chapter 3. In chapter 5,it discusses the VRPSDP with multi-vehicle and multi-distribution centers. For theproblems in the last three chapters, it separately establishes the 0-1 integerprogramming model and solves all problems with the tabu search algorithm,illustrating the corresponding tabu search algorithm by a corresponding numericalexample. As the three problems discussed by the last three chapters are different, sothe tabu search algorithm for each of them is different: 1. According to thecharacteristics of the problem in each chapter, this thesis constructs different heuristicalgorithms to get the corresponding feasible solution for each problem, then takes thefeasible solutions as the initial solution in the corresponding tabu search algorithm; 2.In chapter 4, the evaluation function in tabu search algorithm is different from theother two evaluation functions in chapter3 and chapter 5 , which increases the punishment of beyond time window constraints; 3. In chapter 5, the expression of thesolutions in tabu search algorithm is different from those in chapter 3 and chapter 4,which leads to the way of producing neighbors is different. At the last part of thispaper, it summarizes the vehicle routing optimization problems with reverse logisticsin B2C E-commence and discusses the direction of future research for them.