An adaptive heuristic to the bounded-diameter minimum spanning tree problem

Soft Computing

Volumn 16, Issue 11, 2012, Pages 1977-1988

  Akbari Torkestani, Javad ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Bounded diameter minimum spanning tree problem; Constrained spanning tree; Learning automata theory; Spanning tree

Indexed keywords

DECENTRALIZED LEARNING; GRAPH G; LEARNING AUTOMATA; MINIMUM SPANNING TREE PROBLEM; MINIMUM WEIGHT; NEAR-OPTIMAL SOLUTIONS; NP-HARD; SOLUTION QUALITY; SPANNING TREE;

ALGORITHMS; AUTOMATA THEORY; PARALLEL ARCHITECTURES;

TREES (MATHEMATICS);

EID: 84867698029     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-012-0869-6     Document Type: Article

References (53)

1. Abdalla A, Deo N, Gupta P (2000) Random-tree diameter and the diameter-constrained MST. Congressus Numerantium 144: 161-182.
2. Achuthan NR, Caccetta L, Caccetta P, Geelen A (1994) Computational methods for the diameter restricted minimum-weight spanning tree problem. Aust J Comb 10: 51-71.
3. Aggarwal V, Aneja Y, Nair K (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9: 287-296.
4. Akbari Torkestani J (2012a) Degree constrained minimum spanning tree problem in stochastic graph. J Cybern Syst 43(1): 1-21.
5. Akbari Torkestani J (2012b) An adaptive backbone formation algorithm for wireless sensor networks. Comput Commun (in press).
6. Akbari Torkestani J (2012c) A new approach to the job scheduling problem in computational grids. Clust Comput (in press).
7. Akbari Torkestani J (2012d) LAAP: A learning automata-based adaptive polling scheme for clustered wireless ad-hoc networks. Wirel Pers Commun (in press).
8. Akbari Torkestani J (2012e) Mobility prediction in mobile wireless Networks. J Netw Comput Appl (in press).
9. Akbari Torkestani J (2012f) An adaptive learning automata-based ranking function discovery algorithm. J Intel Inf Syst (in press).
10. Akbari Torkestani J (2012g) A stable virtual backbone for wireless MANETS. Telecommun Syst J (in press).
11. Akbari Torkestani J (2012h) An adaptive focused web crawling algorithm based on learning automata. Appl Intel (in press).
12. Akbari Torkestani J, Meybodi MR (2011a) LLACA: an adaptive localized clustering algorithm for wireless ad hoc networks based on learning automata. J Comput Electr Eng 37: 461-474.
13. Akbari Torkestani J, Meybodi MR (2011b) A link stability-based multicast routing protocol for wireless mobile ad hoc networks. J Netw Comput Appl 34(4): 1429-1440.
14. Akbari Torkestani J, Meybodi MR (2012) Finding minimum weight connected dominating set in stochastic graph based on learning automata. Inf Sci 200: 57-77.
15. Ballardie A, Francis P, Crowcroft J (1993) Core-based trees (CBT)-an architecture for scalable inter-domain multicast routing. Comput Commun Rev 23(4): 85-95.
16. Beasley EJ (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11): 1069-1072.
17. Beasley EJ (2005) OR-Library: Capacitated MST. http://people. brunel. ac. uk/~mastjjb/jeb/orlib/capmstinfo. html.
18. Binh H, Nghia N (2009) New multiparent recombination in genetic algorithm for solving bounded-diameter minimum spanning tree problem. In: Proceedings of 1st Asian Conference on intelligent information and database systems, pp 283-288.
19. Binh H, Hoai N, McKay RI (2008) A new hybrid genetic algorithm for solving the bounded-diameter minimum spanning tree problem. In: Proceedings of IEEE World Congress on computational intelligence (CEC'2008), pp 3127-3133.
20. Bookstein A, Klein ST (2001) Compression of correlated bitvectors. Inf Syst 16: 110-118.
21. Bui TN, Zrncic CM (2006) An ant-based algorithm for finding degree-constrained minimum spanning tree. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, pp 11-18.
22. Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8: 67-71.
23. Gouveia L, Magnanti TL (2003) Network flow models for designing diameter-constrained minimum-spanning and steiner trees. Networks 41(3): 159-173.
24. Gouveia L, Magnanti TL, Requejo C (2004) A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44: 254-265.
25. Gouveia L, Simonetti L, Uchoa E (2011) Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. J Math Program 128(1-2): 123-148.
26. Gruber M, Raidl GR (2005) Variable neighborhood search for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 18th Mini Euro Conference on variable neighborhood search. Tenerife, Spain.
27. Gruber M and Raidl GR (2005) A New 0-1 ILP approach for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 2nd International Network Optimization Conference.
28. Gruber M, Raidl GR (2009) Exploiting hierarchical clustering for finding bounded-diameter minimum spanning trees on Euclidean instances. In: Proceedings of the 11th Annual Conference on genetic and evolutionary computation (GECCO). Canada, pp 263-270.
29. Gruber M, Hemert J, Raidl GR (2006) Neighborhood searches for the bounded-diameter minimum spanning tree problem embedded in a VNS, EA and ACO. In: Proceedings of Genetic and Evolutionary Computational Conference (GECCO'2006).
30. Hanr L, Wang Y (2006) A novel genetic algorithm for degree-constrained minimum spanning tree problem. Int J Comput Sci Netw Secur 6(7A): 50s-57s.
31. Julstrom BA (2004) Encoding bounded-diameter minimum spanning trees with permutations and random keys. In: Proceedings of Genetic and Evolutionary Computational Conference (GECCO'2004).
32. Julstrom BA (2004) Encoding bounded-diameter minimum spanning trees with permutations and with random keys. In: Proceedings of the Genetic and Evolutionary Computation Conference (Lecture Note on Computer Science), vol 3102, pp 1282-1281.
33. Julstrom BA, Raidl GR (2003) A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Genetic and Evolutionary Computation Conferences Workshops Proceedings, Workshop on analysis and design of representations, pp 2-7.
34. Karp RM (1972) Reducibility among combinatorial problems, complexity of computer computations. Plenum Press, USA, pp 85-103.
35. Krishnamoorthy M, Ernst A (2001) Comparison of algorithms for the degree constrained minimum spanning tree. J Heuristics 7: 587-611.
36. Kruskal JB (1956) On the shortest spanning sub tree of a graph and the traveling salesman problem. In: Proceedings of American Mathematical Society, pp 748-750.
37. Lourenço HR, Martin OC, Stutzle T (2002) Iterated local search. Handbook of Metaheuristics, Kluwer, pp 321-353.
38. Lucena A, Ribeiro CC, Santos AC (2010) A hybrid heuristic for the diameter-constrained minimum spanning tree problem. J Global Optim 46: 363-381.
39. Narendra KS, Thathachar MAL (1989) Learning automata: an introduction. Prentice-Hall, New York.
40. Oencan T, Cordeau JF, Laporte G (2008) A tabu search heuristic for the generalized minimum spanning tree problem. Eur J Oper Res 191(2): 306-319.
41. Oncan T (2007) Design of capacitated minimum spanning tree with uncertain cost and demand parameters. Inf Sci 177: 4354-4367.
42. Parsa M, Zhu Q, Garcia-Luna-Aceves JJ (1998) An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Trans Networking 6(4): 461-474.
43. Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36: 1389-1401.
44. Raidl GR, Julstrom BA (2003) Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 2003 ACM Symposium on APPLIED Computing, pp 747-752.
45. Raidl GR, Julstrom BA (2003b) Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7(3): 225-239.
46. Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7(1): 61-77.
47. Requejo C, Santos E (2009) Greedy heuristics for the diameter-constrained minimum spanning tree problem. J Math Sci 161(6): 930-943.
48. Salama HF, Reeves DS, Viniotis Y (1997) The delay-constrained minimum spanning tree problem. In Proceedings of the Second IEEE Symposium on computers and communications, pp 699-703.
49. Santos AC, Lucena A, Ribeiro CC (2004) Solving diameter-constrained minimum spanning tree problem in dense graphs. Lect Notes Comput Sci 3059: 458-467.
50. Sharaiha YM, Gendreau M, Laporte G, Osman IH (1998) A tabu search algorithm for the capacitated shortest spanning tree problem. Networks 29(3): 161-171.
51. Singh A, Gupta AK (2007) Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Comput 11(10): 911-921.
52. Soak SM, Jeon M (2010) The property analysis of evolutionary algorithms applied to spanning tree problems. Appl Intell 32(1): 96-121.
53. Thathachar MAL, Harita BR (1987) Learning automata with changing number of actions. IEEE Trans Syst Man Cybern SMG17: 1095-1100.