New multi-parent recombination in genetic algorithm for solving bounded diameter minimum spanning tree problem

Proceedings - 2009 1st Asian Conference on Intelligent Information and Database Systems, ACIIDS 2009

Volumn , Issue , 2009, Pages 283-288

  Binh, Huynh Thi Thanh ^a   Nghia, Nguyen Duc ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DIAMETER; COMPUTATIONAL EXPERIMENT; MINIMUM SPANNING TREE PROBLEM; NP-HARD; RECOMBINATION OPERATORS; SPANNING TREE; UNDIRECTED GRAPH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; DATABASE SYSTEMS; MATHEMATICAL OPERATORS;

GRAPH THEORY;

EID: 70449125677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACIIDS.2009.89     Document Type: Conference Paper

References (24)

1. M.R. Garey and D.S.Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.
2. K. Raymond, "A Tree-based Algorithm for Distributed Mutual Exclusion", ACM Transactions on Computer Systems, 7 (1), 1989, pp. 61-77.
3. K. Bala, K. Petropoulos, and T. E. Stern, "Multicasting in a linear Lightwave Network", in Proceedings of IEEE INFOCOM'93, 1993, pp. 1350-1358.
4. 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.
5. 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.
6. A. Bookstein and S. T. Klein, "Compression of Correlated Bit-Vectors", Information Systems, 16 (4), 1996, pp. 387-400.
7. G. Kortsarz and D. Peleg, "Approximating Shallow-light Trees", in Proceedings of the 8th Symposium on Discrete Algorithms, 1997, pp. 103-110.
8. 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.
9. 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.
10. A. Abdalla, "Computing a Diameter-constrained Minimum Spanning Tree", PhD Dissertation, The School of Electrical Engineering and Computer Science, University of Central Florida, 2001.
11. 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.
12. 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.
13. 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.
14. 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.
15. 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.
16. M. Gruber and G.R. Raidl, "A New 0-1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem, in Proceedings of the 2nd International Network Optimization Conference, 2005.
17. M. Gruber and G.R. Raidl, "Variable Neighbourhood Search for the Bounded Diameter Minimum Spanning Tree Problem, in Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Spain, 2005.
18. 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.
19. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms, 2nd Edition, Springer-Verlag, 2006.
20. Nguyen Duc Nghia and Huynh Thi Thanh Binh, "A New Recombination Operator for Solving Bouded Diameter Minimum Spanning Tree Problem", in Proceedings of RIVF'2007, LNCS, 2007.
21. A. Singh and A.K. Gupta, "An Impoved Heuristic for the Bounded Diameter Minimum Spanning Tree Problem, Journal of Soft Computing, 11, 2007, pp. 911-921.
22. G. Kortsarz and D. Peleg, "Approximating the Weight of Shallow Steiner Trees", Discrete Application Mathematics, 93, 1999, pp. 265-285.
23. R. Prim, "Shortest Connection Networks and Some Generalization" , Bell System Technical Journal, 36, 1957, pp. 1389-1401.
24. 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 the Proceedings of IEEE Congress on Evolutionary Computation (CEC'2008), 2008, pp. 3127-3131.