Multi-objective Logistics Distribution Path Optimization Based on Annealing Evolution Algorithm

Abstract

Logistics distribution is a collection of interrelated organizations and facilities. There is a waste of cost and time in many links. Therefore, it is particularly important to use information technology to improve distribution efficiency. Under the constraints of delivery vehicle cost and time, this paper proposes an improved genetic simulated annealing algorithm (SAGA), which combines the global search ability of the genetic algorithm (GA) and the simulated annealing algorithm (SA) with strong local search ability to solve the vehicle routing problem with time windows (VRPTW). The perturbation factor is introduced to improve the local search, and the crossover method is optimized to obtain more efficient genetic operators by using population information. In this paper, combined with the actual application case, the simulation experiment is carried out in MATLAB. The experimental results show that, compared with the traditional genetic algorithm and simulated annealing algorithm, the total cost of the improved genetic simulated annealing algorithm is reduced by about 15%, which provides a more suitable vehicle route planning scheme.