Vui lòng dùng định danh này để trích dẫn hoặc liên kết đến tài liệu này: https://elib.vku.udn.vn/handle/123456789/3954
Nhan đề: A hybrid genetic algorithm for the steiner tree problem in graphs towards optimizations for wireless sensor networks
Tác giả: Le, Tang Phu Quy
Ho, Sy Bao Nhan
Hoang, Tan Phu Quoc
Huynh, Cong Phap
Dang, Dai Tho
Từ khoá: Steiner tree problem
Genetic algorithm
Hybrid genetic algorithm
Node placement optimization in wireless sensor networks
Năm xuất bản: thá-2024
Nhà xuất bản: The University of Da Nang, Journal of Science and Technology
Tóm tắt: 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.
Mô tả: The University of Da Nang - Journal of Science and Technology; Vol. 22, No. 6B; pp: 14-18
Định danh: https://jst-ud.vn/jst-ud/article/view/9182/6224
https://elib.vku.udn.vn/handle/123456789/3954
ISSN: 1859-1531
Bộ sưu tập: NĂM 2024

Các tập tin trong tài liệu này:

 Đăng nhập để xem toàn văn



Khi sử dụng các tài liệu trong Thư viện số phải tuân thủ Luật bản quyền.