AJOR  Vol.3 No.1 A , January 2013
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 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.


Cite this paper
Q. Zhang, Z. Shen and X. Zhang, "Research on Location Routing Problem (LRP) Based on Chaos Search (CS) and Empirical Analysis," American Journal of Operations Research, Vol. 3 No. 1, 2013, pp. 147-152. doi: 10.4236/ajor.2013.31A014.
References
[1]   J. H. Bookbinder and K. E. Reece, “Vehicle Routing Considerations in Distribution System Design,” European Journal of Operation Research, Vol. 37, No. 2, 1988, pp. 204-213. doi:10.1016/0377-2217(88)90330-X

[2]   D. B. Bruno, F. Vincent, S. Paul, K. Philip and P. Patrick, “Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics,” Journal of Heuristics, Vol. 6, No. 4, 2000, pp. 501-523. doi:10.1023/A:1009621410177

[3]   V. Campos and E. Mota, “Heuristic Procedures for the Capacitated Vehicle Routing Problem,” Computational Optimization and Applications, Vol. 16, No. 3, 2000, pp. 265-277. doi:10.1023/A:1008768313174

[4]   L. Cooper, “The Transportation-Location Problem,” Operations Research, Vol. 20, No. 1, 1972, pp. 94-108. doi:10.1287/opre.20.1.94

[5]   G. Dijin, “Hybrid Evolutionary Method for Capacitated Location-Allocation Problem,” Computer and Industrial Engineering,” Vol. 33, No. 3-4, 1997, pp. 577-580.

[6]   V. Fernando and A. Joaquin, “Homoclinic Chaos in Inverted Pendula,” Proceeding of the 39th IEEE Conference On Decision and Control, Sydney, 12-15 December 2000, pp. 4821-4822.

[7]   H. Heung-Suk, “Design of Supply-Chain Logistics System considering Service Level,” Computers and Industrial Engineering, Vol. 43, No. 7, 2002, pp. 283-297. doi:10.1016/S0360-8352(02)00075-X

[8]   G. Laporte, “Hamiltonian Location Problems,” European Journal of Operation Research, Vol. 12, No. 1, 1983, pp. 80-87. doi:10.1016/0377-2217(83)90182-0

[9]   G. Laporte and Y. Nobert, “An Exact Algorithm for Minimizing Routing and Operating Costs in Depot Location,” European Journal of Operation Research, Vol. 6, No. 2, 1986, pp. 224-226. doi:10.1016/0377-2217(81)90212-5

[10]   J. Ra, “Dissipative Enterprises, Chaos, and the Principles of Lean Organizations,” Omega, Vol. 26, No. 6, 1998, pp. 397-340.

[11]   C. Watson-Gandy and P. Dohrn, “Depot Location with van Salesmen—A Practical Approach,” Omega, Vol. 1, No. 3, 1973, pp. 321-329. doi:10.1016/0305-0483(73)90108-4

[12]   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

 
 
Top