Crowdsourcing Takeout Distribution Route Optimization Considering Pickup and Delivery

This paper discusses the combinatorial optimization problem of order allocation and distribution route optimization on crowdsourcing takeout 020 platform. The problem of takeout 020 platform is how to match crowdsourcing workers in different locations with takeout orders and optimize the distribution route to achieve the lowest cost on the premise of fulfilling all current orders. This paper solves the problem by minimizing the total cost which contains distribution cost and time cost considering the locations of crowdsourcing workers, the distribution process of pickup and delivery, time constraint and so on. The model is solved by MATLAB and the results are analyzed to provide support for decision-making to reduce the distribution cost of takeout 020 platform.