New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 373-380

  Binh, Thanh Thi Huynh ^a   McKay, Robert I ^b   Hoai, Nguyen Xuan ^b   Nghia, Nguyen Duc ^a  

^a HANOI UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Viet Nam)

^b Seoul National University   (South Korea)

Author keywords

Bounded diameter minimum spanning tree; Heuristic algorithm; Hybrid genetic algorithm; Multi parent crossover

Indexed keywords

BENCHMARK-PROBLEM INSTANCES; BOUNDED DIAMETER; CENTER-BASED; EUCLIDEAN; HEURISTIC AND GENETIC ALGORITHMS; HYBRID GENETIC ALGORITHMS; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; MULTI-PARENT CROSSOVER; NON-EUCLIDEAN;

GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; PORTALS;

HEURISTIC ALGORITHMS;

EID: 72749117162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569953     Document Type: Conference Paper

References (26)

1. A. Abdalla, N. Deo, and P. Gupta, Random-tree Diameter and the Diameter Constrained MST, in Proceedings of Congress on Numerantium, 2000, pp. 161-182.
2. A. Abdalla, Computing a Diameter-constrained Minimum Spanning Tree, PhD Dissertation, The School of Electrical Engineering and Computer Science, University of Central Florida, 2001.
3. N.R.Achuthan, L.Caccetta, P.Caccetta, and A. Geelen, Computational Methods for the Diameter Restricted Minimum Weight Spanning Tree Problem, Australian Journal of Combinatorics, 10, 1994, pp.51-71.
4. A. Bookstein and S. T. Klein, Compression of Correlated Bit-Vectors, Information Systems, 16 (4), 1996, pp. 387-400.
5. K. Bala, K. Petropoulos, and T. E. Stern, Multicasting in a linear Lightwave Network, in Proceedings of IEEE INFOCOM'93, 3 (1993), pp. 1350-1358.
6. M.R. Garey and D.S.Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman, New York, 1979, 206.
7. J.Gottlieb, B.A.Julstrom, F.Rothlauf, and G.R.Raidl, Prufer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'2001), 2001, pp.343-350.
8. L Gouveia, T.L. Magnanti and C. Requejo, A 2-Path Approach for Odd Diameter Constrained Minimum Spanning and Steiner Trees, Network, 44 (4), 2004, pp. 254-265.
9. nd International Network Optimization Conference, 2005.
10. th Mini Euro Conference on Variable Neighborhood Search, Spain, 2005.
11. M. Gruber, J. Hemert, and G.R. Raidl, Neighbourhood 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), 2006.
12. Huynh Thi Thanh Binh, Nguyen Xuan Hoai, R.I McKay, 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), 2008, pp.3127-3133.
13. Huynh Thi Thanh Binh, Nguyen Duc Nghia, 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, 2009, pp.283-288.
14. B.A. Julstrom, G.R. Raidl, A Permutation Coded Evolutionary for the Bounded Diameter Minimum Spanning Tree Problem, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'2003), 2003, pp.2-7.
15. B.A. Julstrom, Encoding Bounded Diameter Minimum Spanning Trees with Permutations and Random Keys, in Proceedings of Genetic and Evolutionary Computational Conference (GECCO'2004), 2004.
16. B.A Julstrom BA, Greedy heuristics for the boundeddiameter minimum spanning tree problem, ACM Journal of Experimental Algorithmics, vol 14, 2009.
17. th Symposium on Discrete Algorithms, 1997, pp. 103-110.
18. G. Kortsarz and D. Peleg, Approximating the Weight of Shallow Steiner Trees, Discrete Application Mathematics, 93, 1999, pp. 265-285.
19. Nguyen Duc Nghia and Huynh Thi Thanh Binh, A New Recombination Operator for Solving Bounded Diameter Minimum Spanning Tree Problem, in Proceedings of RIVF'2007, LNCS, 2007.
20. C.C. Palmer and A. Kershenbaum, Representing Trees in Genetic Algorithms, in Proceedings of The First IEEE Conference on Evolutionary Computation, 1994, pp. 379-384.
21. R. Prim, Shortest Connection Networks and Some Generalization, Bell System Technical Journal, 36, 1957, pp. 1389-1401.
22. G.R. Raidl and B.A. Julstrom, Edge-sets: An Effective Evolutionary Coding of Spanning Trees, IEEE Transactions on Evolutionary Computation, 7, 2003, pp.225-239.
23. G.R. Raidl and B.A. Julstrom, Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem, in Proceeding of the ACM Symposium on Applied Computing, 2003, pp. 747-752.
24. K. Raymond, A Tree-based Algorithm for Distributed Mutual Exclusion, ACM Transactions on Computer Systems, 7 (1), 1989, pp. 61-77.
25. nd Edition, Springer-Verlag, 2006.
26. A. Singh and A.K. Gupta, Impoved Heuristics for the Bounded Diameter Minimum Spanning Tree Problem, Journal Soft Computing, 11, 2007, pp. 911-921.