計(jì)算機(jī)網(wǎng)絡(luò)k-劃分優(yōu)化遺傳算法講解-資料下載頁(yè)
2025-06-25 05:16本頁(yè)面
【正文】 2 潘正君, 康立山, 陳毓屏. : 清華大學(xué)出版社，19983 Songerwala M. Efficient solutions to the network division problem. [thesis].the Curtin University of Technology, 19944 . Intelligent structural operators for the kway graph partitioning problem. ICGA’ Kaufman，1991Design a Genetic Algorithm for Optimizing kWay Networks Partitioning Problem Based on Directionless Graph TheoryHuang Xinli Yan Guangle(School of Management，Univ. of Shanghai for Sci. amp。 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
環(huán)評(píng)公示相關(guān)推薦
鄂ICP備17016276號(hào)-1