PCI Planning Scheme Based on Genetic Algorithm

With the widespread adoption of 5G technology and the promotion of 6G technology, the planning of Physical Cell Identifiers (PCIs) has become increasingly important. Due to the limited number of PCIs, improper allocation can cause signal interference and network congestion, thereby affecting network performance. To address this issue, this paper proposes a PCI planning method based on genetic algorithms. By introducing optimization techniques such as local search, Lamarckian improvement, and meme updating, the convergence speed of the algorithm and the quality of solutions are enhanced. The genetic algorithm effectively resolves PCI conflicts through global search, while local search further optimizes adaptability. Lamarckian improvement accelerates convergence, and meme updating avoids local optima. Experimental analysis shows that, compared with traditional PCI planning methods, this method can significantly reduce signal interference and optimize resource distribution when the base station scale is moderate, thereby improving network performance.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/cisce65916.2025.11065079
Primary Topic
Manufacturing Process and Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PCI Planning Scheme Based on Genetic Algorithm

Dongyang Xi, Xun Wang, Yang Liu, Yan Gao
Manufacturing Process and Optimization
article

PCI Planning Scheme Based on Genetic Algorithm

Dongyang Xi, Xun Wang, Yang Liu, Yan Gao
article en

Abstract

With the widespread adoption of 5G technology and the promotion of 6G technology, the planning of Physical Cell Identifiers (PCIs) has become increasingly important. Due to the limited number of PCIs, improper allocation can cause signal interference and network congestion, thereby affecting network performance. To address this issue, this paper proposes a PCI planning method based on genetic algorithms. By introducing optimization techniques such as local search, Lamarckian improvement, and meme updating, the convergence speed of the algorithm and the quality of solutions are enhanced. The genetic algorithm effectively resolves PCI conflicts through global search, while local search further optimizes adaptability. Lamarckian improvement accelerates convergence, and meme updating avoids local optima. Experimental analysis shows that, compared with traditional PCI planning methods, this method can significantly reduce signal interference and optimize resource distribution when the base station scale is moderate, thereby improving network performance.

Shenyang Jianzhu University (CN)
Foundation of Liaoning Province Education Administration, Shenyang Jianzhu University
Openalex Percentile: Top 77%
Manufacturing Process and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.