With developments in the express delivery industry, statistics indicate that by 2023, the number of parcels exceeded 132.07 billion. The efficiency of couriers in delivering packages has become a service issue for many companies. This thesis, grounded in the courier path problem, draws on the Traveling Salesman Problem (TSP) to construct a delivery route planning model. This model uses an annealing algorithm for solving. It views each destination as a point and sets a variable x to 0 (if the edge is not retained) or 1 (if retained) for any point-to-point edge. Experimental results from the model's solution reveal that the method significantly reduces delivery path length, enhances efficiency, and cuts down time and cost. The approach not only enhances competitiveness and customer satisfaction for food delivery enterprises but also offers valuable insights for optimizing urban logistics distribution.
Research Article
Open Access