Research on Location Selecting for Logistics Distribution Center Based on Ant Colony Algorithm

This paper mainly conducts researches on the optimization and scheduling problems of the location selection for logistics distribution center. In order to effectively savings the transportation costs, and optimize the selection of urban vehicle scheduling path. Especially for the complex road network, there are many parameters for setting, which has made the traditional scheduling algorithm more complex in computation. In addition, it is not conducive to solve the practical application problems. In this condition, in order to avoid the problems caused by the traditional optimal scheduling algorithm for the location selection, including the factors are too many, while the factors are associated tightly with each other, and so on, this paper thus has proposed an improved and optimized ant colony algorithm for logistics location selection. This algorithm has firstly decomposition the obtained solution algorithm to the pairs, and then by using an improved optimized ant colony algorithm, we have transform these solutions from the feature of uncertainties into the ones of certainty, which has greatly de-sized the solution process. Simulation results show that the proposed optimal scheduling algorithm has reduced the computational complexity, optimizing a site model and provide new ways to solve the logistics locating selection problems.