The property analysis of evolutionary algorithms applied to spanning tree problems

Applied Intelligence

Volumn 32, Issue 1, 2010, Pages 96-121

  Soak, Sang Moon ^a   Jeon, Moongu ^b  

^a Korea Intellectual Property Office   (South Korea)

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

Author keywords

Constrained spanning tree problems; Evolutionary algorithms; Genetic encoding method; Property analysis

Indexed keywords

CANDIDATE SOLUTION; CONSTRAINED SPANNING TREE PROBLEMS; DECODER-BASED EVOLUTIONARY ALGORITHMS; EDGE-SETS; ENCODINGS; GENETIC ENCODING; GENETIC OPERATORS; OPTIMIZATION PROBLEMS; POPULATION DIVERSITY; SEARCH BEHAVIOR; SEARCHING BEHAVIOR; SHOW THROUGH; SPANNING TREE; SPANNING TREE PROBLEMS;

DECODING; DYNAMIC ANALYSIS; ENCODING (SYMBOLS); MATHEMATICAL OPERATORS;

EVOLUTIONARY ALGORITHMS;

EID: 75849127847     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-008-0137-8     Document Type: Article

References (42)

1. Alternberg L (1997) Fitness distance correlation analysis: an instructive counterexample. In: Proceeding of the seventh international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 57-64
2. JC Bean 1994 Genetic algorithms and random keys for sequencing and optimization ORSA J Comput 6 2 154 160 0807.90060
3. H Chou G Premkumar CH Chu 2001 Genetic algorithms for communications network design-an empirical study of the factors that influence performance IEEE Trans Evol Comput 5 3 236 249 10.1109/4235.930313
4. PC Chu JE Beasley 1998 A genetic algorithm for the multidimensional knapsack problem J Heuristics 4 63 86 0913.90218 10.1023/A:1009642405419
5. Deo N, Kumar N (1996) Computation of constrained spanning trees: a unified approach. In: Lecture notes in economics and mathematical systems, vol 450. Springer, Berlin, pp 194-220
6. Eckert C, Gottlieb J (2002) Direct representation and variation operators for the fixed charge transportation problem. In: Parallel problem solving in nature VII. Lecture notes in computer science, vol 2439. Springer, Berlin, pp 77-87
7. Gaube T, Rothlauf F (2001) The link and node biased encoding revisited: bias and adjustment of parameters. In: Evo worshop 2001. Lecture notes in computer science, vol 2037. Springer, Berlin, pp 1-10
8. M Gen R Chen 1997 Genetic algorithms and engineering design Wiley New York Also see (for Prüfer encoding): http://www.ads.tuwien.ac.at/ publications/bib/pdf/gottlieb-01.pdf
9. Gen M, Chen R (1997) Genetic algorithms and engineering design. Wiley, New York. Also see (for Prüfer encoding): http://www.ads.tuwien.ac.at/ publications/bib/pdf/gottlieb-01.pdf
10. Gottlieb J, Eckert C (2000) A comparison of two representations for the fixed charge transportation problem. In: Parallel problem solving in nature VI. Lecture notes in computer science, vol 1917. Springer, Berlin, pp 345-354
11. Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F (2000) Prüfer numbers: a poor representation of spanning trees of evolutionary search. Working papers in information systems. University of Bayreuth
12. Gottlieb J, Raidl GR (2000) The effects of locality on the dynamics of decoder-based evolutionary search. In: Proceedings of the 2000 genetic and evolutionary computation conference. Morgan Kaufmann, San Francisco, pp 283-290
13. Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings the sixth international conference on genetic algorithm. Morgan Kaufmann, San Francisco, pp 184-192
14. Julstrom BA (2001) The Bolb code: a better string coding of spanning trees for evolutionary search. In: Genetic and evolutionary computation conference. Morgan Kaufmann, San Francisco, pp 256-261
15. M Krishnamoorthy A Ernst Y Sharaiha 2001 Comparison of algorithms for the DC-MST J Heuristics 7 587 611 0987.68613 10.1023/A:1011977126230 (Pubitemid 33068055)
16. Kruskal JB (1956) On the shortest spanning tree of a graph and the travelling salesman problem. In: Proceedings of the American mathematical society, vol 7, no 1, pp 48-50
17. Manderick B, de Weger M, Spiessens P (1991) The genetic algorithm and the structure of the fitness landscape. In: The 4th international conference on genetic algorithms, pp 143-150
18. P Merz B Freisleben 2000 Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning Evol Comput 8 1 61 91 10.1162/106365600568103
19. CC Palmer A Kershenbaum 1995 An approach to a problem in network design using genetic algorithms Networks 26 151 163 0856.90049 10.1002/net.3230260305
20. Palmer CC, Kershenbaum A (1994) Representating trees in genetic algorithms. In: Proceedings of the IEEE conference on evolutionary computation, pp 379-384
21. T Paulden DK Smith 2006 From the dandelion code to the rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality IEEE Trans Evol Comput 10 2 108 123 10.1109/TEVC.2006.871249
22. Picciotto S (1999) How to encode a tree. PhD dissertation, University of California, San Diego
23. R Prim 1957 Shortest connection networks and some generalisations Bell Syst Tech J 36 1389 1401
24. Raidl GR (2000) An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of the IEEE CEC, pp 104-111
25. GR Raidl J Gottlieb 2005 Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem Evol Comput 13 4 441 475 10.1162/ 106365605774666886 (Pubitemid 43955278)
26. GR Raidl B Julstrom 2003 Edge-sets: an effective evolutionary coding of spanning trees IEEE Trans Evol Comput 7 3 225 239 10.1109/TEVC.2002.807275
27. CR Reeves T Yamada 1998 Genetic algorithms, path relinking, and the flowshop sequencing problem Evol Comput 6 45 60 10.1162/evco.1998.6.1.45
28. Rothlauf F (2003) Locality, distance distortion, and binary representations of integers. Working papers in information systems, University of Mannheim
29. F Rothlauf DE Goldberg A Heinzl 2002 Network random keys-a tree network representation scheme for genetic and evolutionary algorithms Evol Comput 10 1 75 97 10.1162/106365602317301781
30. F Rothlauf DE Goldberg 2003 Redundant representations in evolutionary computation Evol Comput 11 4 381 415 10.1162/106365603322519288 (Pubitemid 37439067)
31. Schuter P (1995) Artificial life and molecular evolutionary biology. In: Moran F et al. (eds) Advances in artificial life. Springer, Berlin, pp 3-19
32. Schindler B, Rothlauf F, Pesch H (2002) Evolution strategies, network random keys, and the one-max tree problem. In: Evoworkshops. Springer, Berlin, pp 143-52
33. Sendhoff B, Kreutz M, Seelen WV (1997) A condition for the genotype-phenotype mapping: causality. In: Proceedings of the seventh international conference on genetic algorithms. Morgan Kauffman, San Mateo
34. Soak MS, Corne D, Ahn BH (2004) A powerful new encoding for tree-based combinatorial optimisation problems. In: Parallel problem solving in nature VIII. Lecture notes in computer science, vol 3242. Springer, Berlin, pp 430-439
35. MS Soak D Corne BH Ahn 2006 The edge-window-decoder representation for tree-based problems IEEE Trans Evol Comput 10 2 124 144 10.1109/TEVC.2006.871250
36. MS Soak 2006 A new evolutionary approach for the optimum communication spanning tree problem IEICE Trans Fundam Electron, Commun Comput Sci E89-A 10 2882 2893
37. Soak MS, Corne D, Ahn BH (2004) A new encoding for the degree constrained minimum spanning tree problem. In: KES 2004. Lecture notes in artificial intelligence, vol 3213. Springer, Berlin, pp 952-958
38. Stadler PF (1996) Towards a theory of landscapes. In: Complex systems and binary networks. Lecture notes in physics, vol 461. Springer, New York, pp 77-163
39. E Thompson T Paulden DK Smith 2007 The dandelion code: a new coding of spanning trees for genetic algorithms IEEE Trans Evol Comput 11 1 91 100 10.1109/TEVC.2006.880730 (Pubitemid 46421670)
40. Watson JP, Barbulescu L, Whitley LD, Howe AE Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. http://www.cs.colostate.edu/~genitor/Pubs.html
41. ED Weinberger 1990 Correlated and uncorrelated fitness landscapes and how to tell the difference Biol Cybern 63 325 336 0703.92016 10.1007/BF00202749 (Pubitemid 20289470)
42. G Zhou M Gen 1998 An effective GA approach to the quadratic minimum spanning tree problem Comput Oper Res 25 3 229 237 0904.90169 10.1016/S0305-0548(97)00039-7 1605725