Research on PCI Planning for Communication Networks Based on Greedy Algorithm and Particle Swarm Algorithm

The rapid development of mobile communication networks has imposed new requirements on physical cell identifiers (PCI). The aim of this paper is to explore an optimization algorithm that minimizes the conflicting confusions and interference suffered by the cells at both the aggregate and priority levels. Firstly, the hierarchical decomposition model can decompose the priority-free planning into multiple single-objective plans. And the results of the previous level of optimization are used as the constraints for the next level of optimization. Secondly, two algorithms, particle swarm algorithm and greedy algorithm, can solve the optimal planning in different situations. The optimization algorithm simplifies the complex data set, has good stability, and can serve as a scientific guide for actual physical cell identification code allocation.