A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs

Tran, C. V. and Ha, N. H. (2018) A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs. EAI Endorsed Transactions on Context-aware Systems and Applications, 5 (15): e4. ISSN 2409-0026

[img]
Preview
Text
eai.6-2-2019.156534.pdf - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (2MB) | Preview

Abstract

Steiner Minimal Tree (SMT) is a complex optimization problem that has many important applications in science and technology; This is a NP-hard problem. Much research has been carried out to solve the SMT problem using approximate algorithms. This paper presents A Variable Neighborhood Search (VNS) algorithm for solving the SMT problem in sparse graphs; The proposed algorithm has been tested on sparse graphs in a standardized experimental data system, and it yields better results than some other heuristic algorithms.

Item Type: Article
Uncontrolled Keywords: Minimal tree, sparse graph, variable neighborhood search algorithm, metaheuristic algorithm, Steiner minimal tree
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor II.
Date Deposited: 16 Sep 2020 08:27
Last Modified: 16 Sep 2020 08:27
URI: https://eprints.eudl.eu/id/eprint/302

Actions (login required)

View Item View Item