計算機網(wǎng)絡(luò)k-劃分優(yōu)化遺傳算法講解(參考版)
2025-06-28 05:16本頁面
【正文】 Tech.，Shanghai 200093，China)Abstract The Optimization of kway networks partitioning is a problem of bination Optimization，and the classical genetic algorithms (SGA) can not solve the problem efficiently. In this Paper，the theory of multiway graph partitioning is applied to analyze the problem，and an improved genetic algorithm is presented based on the characteristics of the problem. The algorithm is improved in the following three aspects: the definition of fitness function，the genetic operators and the parameters selection. Some experimental results in an application example have verified the validity and efficiency of the algorithm.Keywords Genetic algorithm Directionless graph kWay partitioning Optimization of networks partitioning 。此外，如何引入更有效的遺傳操作，如何確定適應(yīng)性更高的懲罰函數(shù)以及如何使算法適用于更寬松靈活的約束條件是今后有待進一步研究的問題。表3 變異概率pm分別取不同的值時對算法性能的影響結(jié)果比較變異概率pm求解平均時間（ms）8765533436272294成功率（%） 上述實驗結(jié)果表明，本文設(shè)計的用于網(wǎng)絡(luò)k劃分優(yōu)化問題的改進遺傳算法是正確的和高效的。表1 實際網(wǎng)絡(luò)劃分結(jié)果對比網(wǎng)絡(luò)劃分算法改進的網(wǎng)絡(luò)k劃分遺傳算法經(jīng)典遺傳算法各子網(wǎng)內(nèi)流量（%）~~~~子網(wǎng)間流量（%）表2考察有無空劃分檢查校正操作對算法性能的影響，實驗結(jié)果表明引入檢查校正操作后雖然算法收斂時間有所增加，但成功率有明顯的增加，算法性能得以改進。對第k個劃分，懲罰系數(shù)，當且僅當SubNetk=10時，u=0，否則u=1。6 實驗研究本實驗對一個具有30個節(jié)點的網(wǎng)絡(luò)進行3個子網(wǎng)的劃分優(yōu)
環(huán)評公示相關(guān)推薦
鄂ICP備17016276號-1