关键词: PGSA-GA组合算法, 多目标优化, 多点设施, 选址, 引力与斥力

Abstract: Weber facility location problem is important in the field of combinatorial optimization problems. The core content in the space domain is to find the optimal decision concerns, namely, facility. Because there is no effect between set point in the single facility optimal planning problems, it only considers the gravitation between the facility and the demand points. However, for optimal planning of multi-facility, not only the problem of the gravitation between the facility and demand points, but also from the perspective of resource optimal configuration, it exists the repulsion between the facility points. Therefore, it is needed to select from the view of system optimization plan. Solving the optimization of the Weber-type facilities for multi-point location problem is generally through successive hierarchical method to find a local optimal solution to determine the optimal facility. However, since this method does not take into account the repulsion between the facility, it is easy to cause adhesion. In response to this problem, this article proposes a combination of PGSA-GA algorithm to get global optimal solution of single-point coordinates. Through the establishment of plant growth simulation algorithm, it combines with genetic algorithm for optimization of multipoint facility location model for multiobjective programming derive Pareto optimal solutions and then extend to several location plan.

Key words: PGSA-GA combination algorithm, multi-objective optimization, multi facilities, location, gravitation and repulsion