The Location Problem Of Moving Company

The study of Location Problem is how to select one or more facilities by considering the geographic location makes the goal of reaching optimal. Moving companies are attempting to select a number of residential areas to open the company's stores, the choice of stores needs to consider a number of factors, apart from the city's different divisions as well as the relative geographical location associated with the traffic conditions, there are various residential areas of population as well as the range of the population living in different flows.This paper studies the location problem of the moving company, about giving its mathematic models and how to solve the models. In this paper, we consider the specific issues of the moving companies and discuss the influence factors, such as the cost of transportation and the cost of opening stores. Then we establish three costs optimization models for the location problem of the moving company, according to the different vehicle scheduling ways, combination the linkages between the various stores .Then using the improved genetic algorithm to solve the three models, we obtain an optimal and practical location. Secondly, the simplified parabola method is integrated into the genetic algorithm as a local search operator. Then a novel hybrid genetic algorithm for global optimization problems is proposed to solve the model two. Finally, through the sensitivity analysis and the feasibility of the concrete model has proven the rationality and the feasibility of the model.