Abstract: When customers have a mixed demand for delivering and fetchinggoods, the solution can not be obtained using the traditional TSP (travelling salesman problem) algorithms because of the restraint of the demand for delivery and fetching and the capacity of vehicles. To solve this problem, a model of customer subset distribution is set up. Based on the customer subset distribution, the lasso solution is proposed to select the route with the minimum distribution cost.