Research On The Optimization Of Joint Delivery Of Traditional E-commerce And Takeaway O2O

In recent years,with the improvement of national living standard and the development of Internet technology,the scale of online retailing market is increasing year by year,and the e-commerce industry is more and more prosperous.The e-commerce logistics,however,unable to keep up with the rapid development of e-commerce transactions.Whether the last-mile distribution of the traditional e-commerce,whose cost is 30%of the total logistics' cost,or the city distribution of the takeaway 020 business,which is a new mode of e-commerce,there are many problems,which impede the progress of e-commerce.The last-mile distribution and the city distribution of the takeaway 020 business both are the city distribution of e-commerce,which plays a crucial role in the development of e-commerce enterprises and express enterprises.How to reduce the cost of the e-commerce distribution and improve the quality of the delivery services is an urgent task for e-commerce enterprises and express delivery companies.The current research on E-commerce city distribution mainly focuses on the problems,distribution model,distribution cost composition of the "last mile" distribution,and the distribution model selection,route planning of the takeaway 020 city distribution,etc..There is a lack of research on the joint delivery of them.In this paper,we will study the joint delivery routing problem of the last-mile distribution and the city distribution of takeaway 020 business,to investigate the economy benefit from the joint distribution.At the same time,according to the characteristics of the problem,a joint delivery model is established and the distribution optimization algorithm is designed.The article begins with sorting out the related theoretical research of the e-commerce urban distribution,and analyzing the research status of the domestic and foreign e-commerce urban distribution,and also reviews the related algorithm of vehicle routing problem,laying the foundation for the subsequent path planning algorithm design.The article analyzes the characteristics of the“last mile"problem and finds that it can be transformed into an takeaway 020 distribution problem by creating virtual time windows and taking delivery points.Then a joint delivery model is established based on this finding.However,according to analysis,it is found that the joint delivery model is not suitable for solving large-scale problems,so this paper designs an optimization algorithm.After fully analyzing the characteristics of the joint delivery problem,the paper designs an optimization algorithm based on the thought that decompose the problem into multiple sub-problems,and solve the sub-problems first,generating the distribution path segments,and then combining the distribution path segments to form the final delivery plan.In the sub-problem solving part,algorithms such as RTR and order aggregation construction are used.In the path segment combination part,a 0-1 knapsack dynamic programming algorithm is used.In the case analysis section of the article,a large-scale joint distribution example was designed based on the background and data of the actual problem.The analysis of the results of the example reflects the economics of the same distribution,and the validity and practicability of the algorithm designed in this paper.