Please use this identifier to cite or link to this item:
https://elib.vku.udn.vn/handle/123456789/3954
Title: | A hybrid genetic algorithm for the steiner tree problem in graphs towards optimizations for wireless sensor networks |
Authors: | Le, Tang Phu Quy Ho, Sy Bao Nhan Hoang, Tan Phu Quoc Huynh, Cong Phap Dang, Dai Tho |
Keywords: | Steiner tree problem Genetic algorithm Hybrid genetic algorithm Node placement optimization in wireless sensor networks |
Issue Date: | Jun-2024 |
Publisher: | The University of Da Nang, Journal of Science and Technology |
Abstract: | The 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. |
Description: | The University of Da Nang - Journal of Science and Technology; Vol. 22, No. 6B; pp: 14-18 |
URI: | https://jst-ud.vn/jst-ud/article/view/9182/6224 https://elib.vku.udn.vn/handle/123456789/3954 |
ISSN: | 1859-1531 |
Appears in Collections: | NĂM 2024 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.