P. N. William and J. B. Wesley, “Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search,” Transportation Research Part B, Vol. 34, No. 2, 2000, pp. 107-121. doi:10.1016/S0191-2615(99)00016-8

has been cited by the following article:

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

  AUTHORS: Qian Zhang, Zhongming Shen, Xianji Zhang

  KEYWORDS: Clustering Analysis; Chaos; Chaotic Behavior; Location Routing Problem (LRP);Logistics Distribution; Optimization; Regional Logistics

  JOURNAL NAME: American Journal of Operations Research, Vol.3 No.1A, January 30, 2013

  ABSTRACT: Due to the problem complexity, simultaneous solution methods are limited. A hybrid algorithm is emphatically proposed 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 randomness 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.