CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Hybrid Algorithm for Solving Steiner Tree Problem

by Samira Noferesti, Hamed Shah-hosseini
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 41 - Number 5
Year of Publication: 2012
Authors: Samira Noferesti, Hamed Shah-hosseini
10.5120/5536-7584

Samira Noferesti, Hamed Shah-hosseini . A Hybrid Algorithm for Solving Steiner Tree Problem. International Journal of Computer Applications. 41, 5 ( March 2012), 14-20. DOI=10.5120/5536-7584

@article{ 10.5120/5536-7584,
author = { Samira Noferesti, Hamed Shah-hosseini },
title = { A Hybrid Algorithm for Solving Steiner Tree Problem },
journal = { International Journal of Computer Applications },
issue_date = { March 2012 },
volume = { 41 },
number = { 5 },
month = { March },
year = { 2012 },
issn = { 0975-8887 },
pages = { 14-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume41/number5/5536-7584/ },
doi = { 10.5120/5536-7584 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:28:49.451197+05:30
%A Samira Noferesti
%A Hamed Shah-hosseini
%T A Hybrid Algorithm for Solving Steiner Tree Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 41
%N 5
%P 14-20
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, a hybrid algorithm based on modified intelligent water drops algorithm and learning automata for solving Steiner tree problem is proposed. Since the Steiner tree problem is NP-hard, the aim of this paper is to design an algorithm to construct high quality Steiner trees in a short time which are suitable for real time multicast routing in networks. The global search and fast convergence ability of the intelligent water drops algorithm make it efficient to the problem. To achieve better results, we used learning automata for adjusting IWD parameters. IWD has several parameters. The appropriate selections of these parameters have large effects on the performance and convergence of the algorithm. Experimental results on the OR-library test cases show that the proposed algorithm outperforms traditional heuristic algorithms and other iteration based algorithms with faster convergence speed.

References
  1. Li, K. , Shen, C. , Jaikaeo, C. and Sridhara, V. 2008. Ant-based Distributed Constrained Steiner Tree Algorithm for Jointly Conserving Energy and Bounding Delay in Ad hoc Multicast Routing, ACM Transactions on Autonomous and Adaptive Systems, 3, 1.
  2. Hu, X. , Zhang, J. and Zhang, L. 2009. Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach, EvoWorkshops, 51-60.
  3. Shah-Hosseini, H. 2007. Problem Solving by Intelligent Water Drops, in Proceedings of IEEE Congress on Evolutionary Computation, Singapore, 3226-3231.
  4. Shah-Hosseini, H. 2009. The Intelligent Water Drops Algorithm: A Nature-Inspired Swarm-Based Optimization Algorithm, International Journal of Bio-Inspired Computation, 1 , 71-79.
  5. Shah-Hosseini, H. 2009. Optimization with the Nature-Inspired Intelligent Water Drops Algorithm, In Santos, W. P. D. ed. Evolutionary computation. Tech, Vienna, Austria, 297-320.
  6. Shah-Hosseini, H. 2011. An Intelligent Water Drop Algorithm for Solving Economic Load Dispatch Problem, International Journal of Electrical and Electronics Engineering, 5, 1.
  7. Hougardy, S. , and Promel, H. J. 1999. A 1. 598 Approximation Algorithm for the Steiner Problem in Graphs, ACM-SIAM Symposium on Discrete Algorithm, USA, 448-453, 1999.
  8. Laarhoven, V. and William, J. 2010. Exact and Heuristic Algorithms for the Euclidean Steiner Tree Problem, PhD thesis. , University of Iowa.
  9. Cormen, T. H. , Leiserson, C. E. , Rivest, R. L. , and Stein, C. (2001), Introduction to Algorithms, 2nd edn. MIT Press, Cambridge.
  10. Karp, R. M. 1972. Reducibility among combinatorial problems, In Complexity of Computer Computation, Plenum Press, New York, 8-103.
  11. Garey, M. R. , Graham, R. L. and Johnson, D. S. 1977. The Complexity of Computing Steiner Minimal Trees, SIAM Journal of Applied Mathematics, 32, 4, 835-859.
  12. Garey, M. R. and Johnson, D. S. 1977. The Rectilinear Steiner Tree Problem is NP-complete, SIAM Journal on Applied Mathematics, 32, 4, 826-834.
  13. Esbensen, H. 1995. Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm, Networks, 26, 173-185.
  14. Robins, G. and Zelikovski, A. 2000. Improved Steiner Tree Approximation in Graphs, In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 770-779, 2000.
  15. Diane, M. , and Plesnik, J. 1999. Three New Heuristics for the Steiner Problem in Graphs, Acta Math. , LX, 105-121.
  16. Rayward-smith, V. J. , and Clare, A. 1986. On Finding Steiner vertices, Networks, 16, 283-294.
  17. Kapsalis, A. , Rayward-smith, V. J. , and Smith, J. D. 1993. Solving the Graphical Steiner Tree Problem Using Genetic Algorithms, Journal of the Operational Research Society, 44 , 397-406.
  18. Ding, S. , and Ishii, N. 1995. An Online Genetic Algorithm for Dynamic Steiner Tree Problem, Symposium on Computational Geometry, 337-343.
  19. Zhan, Z. , and Zhang, J. 2009. Discrete Particle Swarm Optimization for Multiple Destination Routing Problems, In Proceedings of EvoWorkshops, 117-122.
  20. Ma, X. and Liu, Q. 2010. A Particle Swarm Optimization for Steiner Tree Problem, In Sixth International Conference on Natural Computation, ICNC 2010, 2561-2565.
  21. Tashakori, M. , Adibi, P. , Jahanian, A. and Norallah, A. (2004), 'Solving Dynamic Steiner Tree Problem by Using Ant Colony System', in 9th Annual Conference of Computer Society Of Iran, Tehran, Iran.
  22. Meybodi, M. R. , and Beigy, H. 2002. A Note on Learning Automata Based Schemes for Adaptation of BP Parameters, Journal of Neurocomputing, 48, 957-974.
  23. Noferesti, S. , and Rajaei, M. 2011. A Hybrid Algorithm Based on Ant Colony System and Learning Automata for Solving Steiner Tree Problem, International Journal of Applied Mathematics and Statistics, 22.
  24. Beasley, J. E. 1990. OR-Library: Distributing Test Problems by Electronic Mail, Operational Research. SOC. , 41 ,11, 1096-1072.
  25. Noferesti, S. , and Rajayi, M. 2009. Solving Steiner Tree Problem by Using Learning Automata, Computational Intelligence and Software Engineering, CiSE 2009, 1-4.
Index Terms

Computer Science
Information Sciences

Keywords

Intelligent Water Drops Algorithm Steiner Tree Problem Learning Automata Parameter Adaptation

Powered by PhDFocusTM