本文通過(guò)采用遺傳算法來(lái)優(yōu)化移動(dòng)網(wǎng)絡(luò)規(guī)劃中的基站布置。解決了基站覆蓋率與經(jīng)
濟(jì)效益之間的矛盾，并且采用實(shí)驗(yàn)向量的編碼方式對(duì)遺傳算子進(jìn)行描述。在遺傳操作中改進(jìn)了選擇算子和變異算子，加快了算法的收斂速度而不會(huì)陷入局部最優(yōu)。實(shí)驗(yàn)結(jié)果證明了算法的有效性，比別的方法更加簡(jiǎn)單和更易于實(shí)現(xiàn)。
關(guān)鍵詞：移動(dòng)網(wǎng)絡(luò)規(guī)劃，基站布置，遺傳算法，變異算子
Abstract: Genetic Algorithms is applied into cell placement of mobile networks
planning. It can settle the contradiction of cell overlay and economic benefit. And
real-numbered vectors are adopted to annotate the genetic operator states. In
genetic operator selection and mutation are improved. The algorithm’s convergence
is accelerated, and it do not drop in local optimization. The results of experiment
prove the efficiency of the algorithm, compare to other algorithm, it is more simple
and easy to implement.
Keyword: mobile networks planning, cell placement, genetic algorithm, mutation