Abstract
A k-cardinality tree problem (KCTP) is to find a subtree with exactly k edges in an undirected, connected, weighted graph, such that the sum of weights is minimal. KCTP has been proved to be an NP-hard combinatorial optimization problem. In this paper, a hybrid algorithm (TSIA) based on Tabu Search (TS) and Immune Algorithm (IA) is presented for solving KCTP. The immune system inspired operator enforces diversity in the population of solutions. Numerical results demonstrate that the proposed algorithm is competitive to existing state-of-art algorithms in both precision and computing time.
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.
