Academic Journals Database
Disseminating quality controlled scientific knowledge

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

ADD TO MY LIST
 
Journal: American Journal of Operations Research
ISSN 2160-8830

Volume: 03;
Issue: 01;
Start page: 147;
Date: 2013;
Original page

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

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 Fujianprovince.

Tango Jona
Tangokurs Rapperswil-Jona

     Affiliate Program