CAJ | 학술논문

公共服务设施选址是一种复杂的空间优化问题，选址的好坏关系到公共服务设施能否发挥其最大作用。利用穷举算法难以对高维的数据问题进行求解。针对空间优化选址的特点及人工蜂群算法收敛速度慢的问题，提出了适合空间选址的邻域搜索新公式，并将交叉的思想引入到了算法中，加快了全局最优解的寻优速度。对算法的可行性和有效性进行了验证，实验表明增强型人工蜂群算法比基本的人工蜂群算法取得了较优的效果。
공공복무설시선지시일충복잡적공간우화문제，선지적호배관계도공공복무설시능부발휘기최대작용。이용궁거산법난이대고유적수거문제진행구해。침대공간우화선지적특점급인공봉군산법수렴속도만적문제，제출료괄합공간선지적린역수색신공식，병장교차적사상인입도료산법중，가쾌료전국최우해적심우속도。대산법적가행성화유효성진행료험증，실험표명증강형인공봉군산법비기본적인공봉군산법취득료교우적효과。
Public service location is a complex problem of spatial optimal location. The position quality has direct impact on whether the public services are able to maximize their effect. Exhaustive algorithm is hard to solve spatial optimal location with high-dimensional data. For space-optimized site characteristics and artificial bee colony algorithm slow convergence problem, a neighborhood searching formula for space-optimized site is proposed, and the crossing idea is introduced into the algorithm to speed up the global optimal solution optimization. The feasibility and effectiveness of the algorithm are verified. Experiments indicate that the enhanced artificial bee colony algorithm achieves better results than the basic artifi-cial bee colony algorithm.