A New Encoding for the Degree Constrained Minimum Spanning Tree Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3213, Issue , 2004, Pages 952-958

  Soak, Sang Moon ^a   Corne, David ^b   Ahn, Byung Ha ^a  

^a Gwangju Institute of Science and Technology (GIST)   (South Korea)

^b UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS);

BLACK BOXES; COMBINATORIAL PROBLEM; DEGREE CONSTRAINTS; DEGREE-CONSTRAINED MINIMUM SPANNING TREE; DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEMS; ENCODING METHODS; OPTIMISATION METHOD; TREE-BASED;

ENCODING (SYMBOLS);

EID: 29144446495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30132-5_128     Document Type: Article

References (23)

1. Abuali, F.N., Wainwright, R.L., Schoenefeld, D.A. 1995. Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem, in Proc. 6th ICGA, Larry J. Eshelman, Ed. 470-477.
2. Bean, J. C. 1994. Genetic algorithms and random keys for sequencing and optimization, ORSA J. Computing,6(2): 154-160.
3. Boldon,B., Deo, N., Kumar, N. 1996. Minimum-weight degree-constrained spanning tree problem : Heuristics and implementation on an SIMD parallel machine. Parallel Computing, Vol. 22. 369-382.
4. Dengiz, B., Altiparmak, F., Smith, A.E., 1997. Local Search Genetic Algorithm for Optimal Design of Reliable Networks, IEEE Trans. on Evolutionary Computation, Vol. 1, No. 3, (1997)
5. Gaube, T., Rothlauf, F., 2001. The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters, EvoWorkshop 2001, LNCS Vol.2037, 1-10.
6. Gen, M., Cheng, R., 1997. Genetic Algorithms and Engineering Design, Wiley.
7. Gottlieb, J., Julstrom, G.A., Raidi, G.R., Rothlauf, F. 2001. Prufer number: A Poor Representation of Spanning Trees for Evolutionary Search, IlliGAL Report No. 2001001, Illinois Genetic Algorithms Lab., Univ. of Illinois.
8. Julstrom, B.A., Raidi, G.R. 2002. Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges, ACM SAC.
9. Knowles, J.D., Corne, D.W. 2000. A new evolutionary approach to the degree-constrained minimum spanning tree problem, IEEE Trans. on Evolutionary Computation, 4(2) pp. 125-134.
10. Krishnamoorthy, M., Ernst, A.T., Sharaiha, Y.M., 2001. Comparision of Algorithms for the Degree Constrained Minimum Spanning Tree, Journal of Heuristics, Vol. 7, 587-611.
11. Yu Li, 2001. An Effective Implementation of a Direct Spanning Tree Representation in GAs, EvoWorkshop 2001, LNCS Vol. 2037, 11-19.
12. Michalewicz, Z., 1992. Genetic Algorithms+Data Structures=Evolution Programs, Springer-verlag.
13. Narula, S.C., Ho, C.A., 1980. Degree-constrained minimum spanning tree, Computer and Operations Research, Vol. 7, 239-249.
14. Palmer, C., Kershenbaum, A., 1994. Representing Trees in Genetic Algorithms, Proc. IEEE ICEC, 379-384.
15. Palmer, C., Kershenbaum, A., 1995. An Approach to a Problem in Network Design Using GAs, Networks 26.
16. Piggott, P., Suraweera, F., 1995. Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem. Progress in Evolutionary Computation, LNAI Vol. 956, Springer, 305-314.
17. Raidl, G.R., Julstrom, B.A., 2002. Edge-Sets: An Effective Evolutionary Coding of Spanning Trees, TR-186-1-01-01, Vienna University of Technology.
18. Raidl, G. R., Drexel, C., 2000. A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem, Late-BreakingPapera, Proc. GECCO 2000, pp. 309-316.
19. Rothlauf, F., Goldberg, D.E., Heinzl, A., 2000. Network Random Keys - A Tree Network Representation Scheme for Genetic and Evolutionary Algorithms, IlliGAL Report No. 2000031.
20. Schindler, B., Rothlauf F., Pesch, H.J., 2002. Evolution Strategies, Network Random Keys, and the One-Max Tree Problem, EvoWorkshops 2002, LNCS Vol. 2279, 143-152.
21. Soak, S.-M., Ahn, B.-H. 2003. New Subtour-Based Crossover Operator for the TSP, GECCO 2003, LNCS Vol. 2724, 1610-1611
22. Zhou, G., Gen, M., 1997. A Note on GAs for Degree-Constrained Spanning Tree Problems, Networks,30, 91-95.
23. Zhou, G., Gen, M., 1998. An Effective Genetic Algorithm Approach to The Quadratic Minimum Spanning Tree Problem, Computers Operations Researches, Vol. 25, NO. 3, 229-237.