|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Variable neighborhood search for the vertex weighted k-cardinality tree problem||Journal:||European Journal of Operational Research||Volume:||171||Issue:||1||First page:||74||Last page:||84||Issue Date:||16-May-2006||Rank:||M21||ISSN:||0377-2217||DOI:||10.1016/j.ejor.2004.07.061||Abstract:||
This paper presents some new heuristics based on variable neighborhood search to solve the vertex weighted k-cardinality tree problem. An efficient local search procedure is also developed for use within these heuristics. Our computational results demonstrate that the new heuristics substantially outperform the state-of-the-art methodologies, including a tabu search and genetic algorithm recently proposed in the literature. We also show that a decomposition approach is best for larger problem sizes than previously investigated. Thus, our findings advance in a significant way the capacity to solve this important class of problems.
|Keywords:||Combinatorial optimization | Metaheuristics | Variable neighborhood search | Vertex weighted k-cardinality tree problem||Publisher:||Elsevier|
Show full item record
checked on Sep 17, 2022
checked on Sep 15, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.