Please use this identifier to cite or link to this item: https://elib.vku.udn.vn/handle/123456789/3954
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLe, Tang Phu Quy-
dc.contributor.authorHo, Sy Bao Nhan-
dc.contributor.authorHoang, Tan Phu Quoc-
dc.contributor.authorHuynh, Cong Phap-
dc.contributor.authorDang, Dai Tho-
dc.date.accessioned2024-07-29T02:35:49Z-
dc.date.available2024-07-29T02:35:49Z-
dc.date.issued2024-06-
dc.identifier.issn1859-1531-
dc.identifier.urihttps://jst-ud.vn/jst-ud/article/view/9182/6224-
dc.identifier.urihttps://elib.vku.udn.vn/handle/123456789/3954-
dc.descriptionThe University of Da Nang - Journal of Science and Technology; Vol. 22, No. 6B; pp: 14-18vi_VN
dc.description.abstractThe Steiner tree problem in graphs (SPG) is one of the most studied problems in combinatorial optimization because of its theories and applications. It is one of the foundations to develop a Wireless Sensor Network (WSNs), such as multicast and topology design. SPG is an NP-Hard problem, and many heuristic and approximation algorithms have been proposed. Thus, this study proposes a Hybrid Genetic algorithm (HGA) to solve SPG. This study is the binary string representation for a set of chosen edges. To increase the diversity of the population and avoid falling into local optimization, we use a 2-longest Distance strategy, dynamic crossover rate, and chosen solutions must differ by at least 5%. The experiment results show that the HGA algorithm's running time equals 153.83% of the GA algorithm's, the deviation found by HGA, and the optimal distance only equals 65% that of GA.vi_VN
dc.language.isoenvi_VN
dc.publisherThe University of Da Nang, Journal of Science and Technologyvi_VN
dc.subjectSteiner tree problemvi_VN
dc.subjectGenetic algorithmvi_VN
dc.subjectHybrid genetic algorithmvi_VN
dc.subjectNode placement optimization in wireless sensor networksvi_VN
dc.titleA hybrid genetic algorithm for the steiner tree problem in graphs towards optimizations for wireless sensor networksvi_VN
dc.typeWorking Papervi_VN
Appears in Collections:NĂM 2024

Files in This Item:

 Sign in to read



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.