Location Problem And Its Model And Algorithm Study

Location Problem is the most classics problem in Operational Research literature. This paper introduces two sorts of location models: continuous location problems and discrete location problems for the different of their solution space, the former 's solution space is continuous and you can set your facilities in every point, while you can just choose your location in a few feasible points in the latter's solution space. Location problem include Weber Problem, P-median problem, P-center problem, the uncapacitated facility location problem, the capacitated location problem, the 2-stage uncapacitated facility location problem, the 2-stage multiproduct capacitated facility location problems and so on.There are many methods to solve these mathematics models, In character 2 Centriod method, Analytic hierarchy process, Fuzzy evaluation method, Branch and bound, Tabu search and Genetic algorithm are given.The forth character is about the single source capacitated plant location problem(SSCPLP). That is all the needs of customers must be supplied by one plant. We borrow ideas from Table dispatching method and raise an improved algorithm for SSCPLP, and it runs well, but for the limit of table, the method we propose can only be used to solve small-scale SSCPLPs.The final part is about the future of location problems in my eyes.