Research on Location Routing Problem (LRP) Based on Chaos Search (CS) and Empirical Analysis

Abstract

Due to the problem complexity, simultaneous solution methods are limited. A hybrid algorithm is emphatically pro-posed for LRP. First, the customers are classified by clustering analysis with preference-fitting rules. Second, a chaos search (CS) algorithm for the optimal routes of LRP scheduling is presented in this paper. For the ergodicity and ran-domness of chaotic sequence, this CS architecture makes it possible to search the solution space easily, thus producing optimal solutions without local optimization. A case study using computer simulation showed that the CS system is simple and effective, which achieves significant improvement compared to a recent LRP with nonlinear constrained optimization solution. Lastly the pratical anlysis is presented relationship with regional logistics and its development in Fujian province.