A new approach for solving the Euclidean Steiner tree problem based on data clustering
Makaleler > Tam Makale · 2022
Yazarlar: Duygu Selin TURAN, Burak ORDİN
Journal of Modern Technology and Engineering, Diğer Kurumların Hakemli Dergileri, Uluslararası, Ebsco, 2022, cilt 7, ss 199-215
Özet
<p>Steiner tree problem is a combinatorial optimization problem, which has many important applications in different areas such as medicine, communication, engineering. Several different algorithms have been developed for the solving of the problem that is NP-Complete. In this paper, new solution algorithms based on data clustering problem are proposed for approximate solution of Steiner tree problem. One of the main purposes of this study is to solve the combinatorial optimization problem with approaches in the field of data mining. The proposed methods are applied on 28 data sets in the literature and the results of preliminary numerical experiments are reported. Steiner tree problem is NP-Complete so that optimal solutions for some of these datasets, especially large scale data sets, can not obtain and are unknown. Therefore, importance of improving algorithms to find approximate solutions for such problems gradually increases.</p>