Abstract
We investigate the NP-hard problem of finding an optimal spanning tree in a given undirected weighted graph, which occurs while minimising the power consumption of data transmission in radio networks. We proposed new heuristics and conducted an a posteriori analysis. All of the proposed methods showed high effectiveness, but it is worth noting a hybrid genetic algorithm using variable neighbourhood search (VNS) as mutations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
