摘要： 图论中的受限p-中心问题是NP-难问题，文中以遗传算法的基本思想为基础，改进了选择、交叉、变异算子，并利用受限节点的概念减少备择点，采用二次选择的策略加快收敛进程。应用到高等级路政管理站选址的优化配置中，取得了令人满意的效果。

关键词: p-中心；受限p-中心；路政管理站选址；遗传算法

Abstract: constrained p-center, defined as to find p vertices in the subset D of V in order to serve the subset R of V by minimizing the maximum serving distance in an edge-weighted graph G = (V，E), is a NP-hard combinational problem. Based on the fundamental framework of genetic algorithm(GA), an improved algorithm is proposed in this paper, in which a new crossover, mutation and selection method is used. The convergence process of genetic algorithm is accelerated by using the strategy of second selection and constrained vertices

Key words: p-center; Constrained p-center; Management station location; Genetic algorithm