A Research On Package Delivery Algorithm Of Crowdsourcing Logistics

Due to the rapid development and popularization of Internet technology,online shopping has become one of the main ways of shopping by virtue of its enormous advantages.Because of the fast package delivery service,the express market is rapidly occupying the same-day delivery service.However,In order to ensure the short time of the package delivery,it will add a large number of special vehicles,which led to additional traffic and pollution problems.Therefore,looking for an environmentally friendly package delivery solution has very important.Crowdsourcing is the task assigned to the company's internal staff in the form of voluntary allocation to other individuals or groups,and it can make full use of existing social resources.Crowdsourcing logistics is to use the idea of the package into the logistics transportation.Using the idea of the Crowdsourcing logistics and the free flowing taxis in the city to accomplish the same-day delivery service is an economical and environmentally friendly solution.Firstly,this paper introduces a package delivery model based on taxi crowd.It is achieved through a two-stage algorithm,the first phase of the algorithm based on the taxi passenger history trajectory data using graph entropy theory to identify the hub road segments of the city,the second phase of the algorithm the package will be delivered between the hub road segments.This paper focuses on the existing package delivery algorithms,including First-Come-First-Service algorithm and Destination-Closer algorithm.Then,this paper takes Luoyang City as an example to realize the package delivery model,and through the experiment from the package delivery success rate,package delivery time,the number of taxis needed to deliver package and the ratio of the total package delivery time and storing time the performance of First-Come-First-Service algorithm and Destination-Closer algorithm are compared,and the advantages and disadvantages of the two algorithms are analyzed.Finally,based on the Destination-Closer algorithm,this paper proposes a improved package delivery algorithm with the longest waiting time of package temporary storage,and gives the method of estimating the longest waiting time threshold by using the taxi history passenger trajectory and the package request data according to the theory of constraint solution.It is proved that the improved Destination-Closer algorithm can be more flexible to assign package delivery tasks,and the overall performance of package distribution is better than the original package delivery algorithm.