Login / Register Submit Your Article
cover
Journal of Engineering Innovations & Technology

Volume 6, 2024 - Issue 3

Submit Manuscript Journal Homepage
Latest Issue
Input keywords, title, abstract, author, affiliation etc..
Article Menu
Browse this journal
Vol. 7 (2025)
Vol. 6 (2024)
Vol. 5 (2023)
Vol. 4 (2022)
Vol. 3 (2021)
Vol. 2 (2020)
Vol. 1 (2019)
Navigation

Journal Article An open access journal
Journal Article

Intelligent Optimization Algorithm Based on Minimum Steiner Tree

by Yuhong Xiao 1 ,  Yulin Chen 2 ,  Kai Li 2 ,  Ziqiang Gong 3 ,  Zongze HE 4  and  Jiahao Li 3,*
1
Shenzhen Senior High School Group International Division, Shenzhen, China
2
University College London, London, United Kingdom
3
Shenzhen Aurora International Academy, Shenzhen, China
4
Fairmont Schools, Anaheim, United States
*
Author to whom correspondence should be addressed.
JEIT  2024 6(3):249; https://doi.org/10.69610/j.eit.20240812
Received: 20 June 2024 / Accepted: 31 July 2024 / Published Online: 12 August 2024
View Full-Text
Download PDF

Abstract

This study explores the application and comparison of the Minimum Steiner Tree (STP) algorithm and the Minimum Spanning Tree (MST) algorithm in optimizing the communication and transportation network in the central area of Kanazawa City. Through a detailed analysis of the classic STP problem and related algorithms, this paper proposes an optimized Ant Colony Optimization algorithm (IACO) and verifies its efficiency on standard datasets. The results show that this algorithm significantly reduces the total connection cost and improves network efficiency and robustness when connecting key nodes. Therefore, this paper suggests that the IACO algorithm has significant application value in urban network planning and recommends further exploration of its potential in larger and more complex networks to optimize the design of urban communication and transportation networks.

Keywords: Minimum Steiner Tree (STP); Network Optimization; Heuristic Algorithm; Graph Theory; Minimum Spanning Tree (MST); Ant Colony Optimization (ACO);
Copyright: © 2024 by Xiao, Chen, Li, Gong, HE and Li. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY) (Creative Commons Attribution 4.0 International License). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
Show Figures

Share and Cite

ACS Style
Xiao, Y.; Chen, Y.; Li, K.; Gong, Z.; HE, Z.; Li, J. Intelligent Optimization Algorithm Based on Minimum Steiner Tree. Journal of Engineering Innovations & Technology, 2024, 6, 249. doi:10.69610/j.eit.20240812
AMA Style
Xiao Y, Chen Y, Li K et al.. Intelligent Optimization Algorithm Based on Minimum Steiner Tree. Journal of Engineering Innovations & Technology; 2024, 6(3):249. doi:10.69610/j.eit.20240812
Chicago/Turabian Style
Xiao, Yuhong; Chen, Yulin; Li, Kai; Gong, Ziqiang; HE, Zongze; Li, Jiahao 2024. "Intelligent Optimization Algorithm Based on Minimum Steiner Tree" Journal of Engineering Innovations & Technology 6, no.3:249. doi:10.69610/j.eit.20240812

Article Metrics

Article Access Statistics

References

  1. Pro.ceedings ofthe thirty-ninth annual ACM symposium on Theory of computing, 2007,67-74
  2. Byrka J, Grandoni F, RothvoB T, et al Steiner tree approximation via iterative randomized round.ing[J]. Journal ofthe ACM, 2013,60(1):1-33
  3. Chlebik M, Chlebikov¡ J. The steiner tree problem on graphs: Inapproximability results[J]. Theoretical Computer Science,2008,406(3):207-214
  4. Abbasi A A,Younis M,Akkaya K.Movement-assisted connectivity restoration in wireless sensor and actor networksUl.lEEE Transactions on Parallel & Distributed Systems,2009,20(9):1366-1379.
  5. Senel fYounis M,Akkaya K.A robust relay node placement heuristic for structurally damaged wireless sensor networks[C]//Proc of lEEE 34th Conference on Local Computer Networks,2009:633-640.
  6. Senel f,Younis M F,Akkaya k.Bio-inspired relay node placement heuristics for repairing damaged wireless sensor networksU].EEE Transactions on Vehicular Technology,2011,60(4):1835-1848.
  7. Lee S,Younis M.Recovery from multiple simultaneous fai- lures in wireless sensor networks using minimumSteiner tree!].Journal of Parallel and Distributed Computing,2010,70(5):525-536.
  8. Senel F,Younis M.Relay node placement in structurally damaged wireless sensor networks via triangular Steiner tree approximation!].Computer Communications,2011,34(16):1932-1941.
  9. Kou L, Markowsky G, Berman L. A fast algorithm for Steiner trees[J]. ActaInformatica, 1981, 15(2):141-145.
  10. Aragão M P D, Werneck R F. On the Implementation of MST-Based Heuristicsfor the Steiner Problem in Graphs[J]. Lecture Notes in Computer Science, 2002,2409:1-15.
  11. Takahashi H. An approximate solution for the Steiner problem in graphs[J].Math. Japonica, 1990, 6: 573-577.
  12. Stefan Voß. Steiner's Problem in Graphs: Heuristic Methods.[J]. DiscreteApplied Mathematics, 1992, 40(92):45-72.
  13. Hwang F K, Richards D S. Steiner tree problems[J]. Algorithmica, 1992,7(1-6):329-332.
  14. Koch, Thorsten. “SteinLib Testdata Collection.” Steinlib.zib.de, 2015, steinlib.zib.de/steinlib.php. Accessed 6 Aug. 2024.