Hi ngh Khoa hc sinh vin trng i hc Bch Khoa H Ni ln th XXVIII-2011 M s:.................

TN CNG TRNH

GII THUT TI U HA BY N GII BI TON CY KHUNG TRUYN THNG TI U

Sinh vin: Lp: Khoa (Vin, Trung tm): in thoi: Thy gio hng dn: Hong Vn Hiu Khoa hc my tnh Kho: 51 Vin Cng ngh thng tin v Truyn thng 0914359670 ThS. Hunh Th Thanh Bnh ThS. Nguyn Duy Hip

TM TT NI DUNG

Bi ton cy khung truyn thng ti u l bi ton thuc lp NP-kh, c nhiu ng dng trong thc t c bit trong vic thit k cc m hnh mng. Bi bo xut mt thut ton dng k thut ti u ho by n nhm gii quyt bi ton ny. nh gi hiu qu ca thut ton xut, chng ti so snh vi kt qu ca thut ton Local Search. Kt qu thc nghim vi 11 bi ton chun v cc b test ln c sinh ngu nhin cho thy thut ton xut tm c s li gii ti u cho hu ht cc b test chun v cho kt qu tt hn vi thut ton LS c. Cht lng li gii i chiu vi tc hi t ca thut ton so vi cc thut ton di truyn tng c s dng l tt hn ng k. Kt qu trn cho thy vic kt hp PSO v local search gii cc bi ton NP-kh trn th l mt hng tip cn c nhiu tim nng. Mt phn ca kt qu nghin cu cng c ng ti ti hi ngh quc t v ng dng tnh ton (The 26th Symposium on Applied Computing, Taiwan).
TI LIU THAM KHO

[2] Hu, T. C. (September, 1974): Optimum communication spanning trees, SIAM Journalon Computing 3 (3), 188195. [3] Johnson, D. S., J. K. Lenstra, and A. H. G. R. Kan (1978): The complexity of the network design problem. Networks 8, pp. 279285. [4] Rothlauf, F. (2006): Representations for Genetic and Evolutionary Algorithms, 2nd edition, Springer. [5] Rothlauf, F. (April 2009): On optimal solutions for the optimal communication spanning tree problem, operation research, vol 57, no2, pp 413-525. [6] Sang-Moon SOAK (2006): A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A(10):2882-2893. [7] Steitz, Wolfgang. Rothlauf, F. (July, 2009): New insights into the OCST problem: Integrating node degrees and their location in the graph, GECCO 2009. [8] Thomas Fischer, Peter Merz. (October, 2007) A Memetic Algorithm for the Optimum Communication Spanning Tree Problem. [9] Xiaodong et al. (2005): A hybrid algorithm based on Particle Swarm Optimization.