A Study On Location Routing Problem In Logistic System

In logistics management decision systems, location allocation problems and vehicle routing problems are the two important fields attracting many concerns. Because of the close links between the pre -choice of facilities and the arrangements of post-route , this paper will study the facilities location combined with vehicular traffic routing problem, namely location routing problems( LRP). Considering the overall correlation between LPA and VRP in logistics system, optimize logistics and distribution channels as a whole.This thesis set up a new three-tier LRP model base on traditional two-tier LRP model,and introduce storage cost of facilities as a important parameter into the model, which has been overlooked at every turn.Taking time which is important in transport problems into account, This papers will study the model by divide into no time window and a time window model.As a NP-hard problem, most of the algorithms for LRP confine to two-phase algorithms or algorithms based on it. It is divided into LAP and VRP problems, and let the output of LAP to be the input of VRP. Obviously, this approach is clearly not incarnet the advantages of LRP which consider LAP and VRP as a whole. Therefore, this paper regards LRP as a whole in solving it, presents a genetic algorithm for one-step solution, the article discussed in detail of the LRP coding, cross, variations in the design process. Using a specific example at the end, to test the feasibility and practicality of this method.