Improving the simulated annealing algorithm for the parallel drone scheduling travelling salesman problem.

Abstract

Using drones combined with trucks for delivery has met requirements in the field of logistics optimization. In this paper, we focus on the problem of optimizing parallel drone-truck scheduling and propose an improvement of the SA (Simulated Annealing) algorithm applied to solve the PDSTSP (Parallel Drone Scheduling Traveling Salesman Problem) with a goal of escaping from local optimal points, expanding the search space and continuously improving the efficiency and stability of the algorithm.