Research on location of pre warehouse based on hybrid immune simulated annealing algorithm

The goal is to maximize customer time satisfaction andminimize the cost of site selection establish a mixed integer programming model. a hybrid immune simulated annealing algorithm is designed to improve the search efficiency of the algorithm. Taking the fresh demand point of fresh agricultural products in an area as an example, the optimal location scheme of pre warehouse is obtained. The results show that the time satisfaction of the obtained scheme is increased by 13.6% and 3.4% respectively compared with that of the immune algorithm and simulated annealing algorithm, and the total cost of location is reduced by 5729 and 8297 yuan respectively. The hybrid immune simulated annealing algorithm can accelerate the convergence speed, obtain higher time satisfaction and lower total cost of location, which provides a reference for the location of pre warehouse.