Using New Efficient Methods to Solve Cell Planning of Base Station in Mobile Communication Network

• Main Authors: Hung-Jen Liao, 廖宏仁
• Other Authors: Cheng-Fa Tsai
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/65632347487702373702

碩士 === 國立屏東科技大學 === 資訊管理系 === 92 === The cell planning problem is very widely-studied and increasingly important in nowadays and future mobile communication. A location management scheme will affect the cost of cell planning in mobile networks. The partition of location areas is developed to minimize the total signalling costs of handling both user location and search operation in cellular networks. This NP—complete problem is commonly solved using heuristics such as genetic algorithms, neural networks, Tabu search and simulated annealing. In this thesis, three new cell planning approaches for base station using Multiple Enhanced Genetic Algorithm (MEGA), Hybrid Improved Tabu Search (HITS) and an Intuitive Algorithm (IA) are proposed. The simulation results obtained by the application to several well-known problems reveal that these absolutely new methods clearly outperform some existing algorithms.