| Autor: |
Tang Phu Quy Le, Bao Nhan Ho Sy, Tan Phu Quoc Hoang, Cong Phap Huynh, Dai Tho Dang |
| Jazyk: |
English<br />Vietnamese |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Tạp chí Khoa học và Công nghệ, Pp 14-18 (2024) |
| Druh dokumentu: |
article |
| ISSN: |
1859-1531 |
| DOI: |
10.31130/ud-jst.2024.195ICT |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
