Year: 2024
Type: article
Abstract: The design of the novel metaheuristic method, called Topological Variable Neighborhood Search, is presented and its theoretical properties are elaborated.The proposed metaheuristic method is implemented, applied to several well-known NP-hard problems on graphs (Metric Dimension Problem, Roman Domination Problem and Maximum Betweeness Problem) and compared with the relevant optimization methods for these problems. The obtained experimental results clearly show that the proposed method achieves a significant improvement for the investigated problems and outperforms other methods that participated in the comparison. In particular, it was shown that the Topological Variable Neighborhood Search is consistently better than the classical Variable Neighborhood Search.
Source: Journal Of Big Data
Authors: Vladimir Filipović, Aleksandar Kartelj
Institution: University of Belgrade
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,090
OpenAlex ID: W4405639937