Multi-warehouse Location of Logistics Based on Dijkstra and Divide-and-Conquer Algorithm

摘要

Warehouse location is extremely important in the whole logistics system. Existing methods to solve this problem, such as Genetic Algorithm or Simulated Annealing Algorithm, require long-term adjustment to get optimal parameters which need redesign when data set change, therefore these methods are not well universal applicability. This paper proposes a heuristic algorithm based on Dijkstra and Divide-and-Conquer Algorithm. Firstly, the sub-problem blocks are constructed. Then, each block is used to calculate the appropriate warehouses. Finally, re-calculate the whole graph to get the final solution based on previous warehouse locations. Simulation results show that the algorithm in this paper can greatly reduce the computation time while get right solution, moreover, there are good solutions for different graphs, and general applicability is strong.