چکیده مقاله
In this paper a novel approach for minimum spanning tree based on genetic algorithm is proposed In this method, new representation of chromosome and more suitable fitness function have been defined At first, a vector in length of complete graph edges as initial chromosome is created For presence or absence of an edge, the corresponding value in chromosome is set to 1 or 0, respectively Fitness function is defined based on graph weights and number of connected components Fitness should be low as possible in each iteration Results of experiments shows proposed method can converge with large number of nodes
کلیدواژهها
نویسندگان
Solmaz Abbasi
Electrical and Computer Engineering Department, Yazd University, Yazd, Iran
Farzane Nadi
Electrical and Computer Engineering Department, Yazd University, Yazd, Iran
Ali mohammad Latif
Electrical and Computer Engineering Department, Yazd University, Yazd, Iran
شیوه ارجاع
Abbasi, Solmaz and Nadi, Farzane and Latif, Ali mohammad,1398,A Genetic Algorithm for Minimum Spanning Tree,3rd International Conference on Soft Computing,Rudsar
ارائهشده در
مجموعه مقالات سومین کنفرانس بین المللی محاسبات نرم29 آبان 1398 · رودسر