The edge-window-decoder representation for tree-based problems

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 2, 2006, Pages 124-144

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

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

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Degree constrained minimum spanning tree problem; Evolutionary algorithm (EA); Optimum communication spanning tree problem (OCST); Quadratic minimum spanning tree problem (q MST); Tree representation

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL OPERATORS; OPTIMIZATION;

DEGREE CONSTRAINED; EDGE-WINDOW-DECODER REPRESENTATION; MINIMUM SPANNING TREE PROBLEM; OPTIMUM COMMUNICATION; QUADRATIC MINIMUM; TREE REPRESENTATION; TREE-BASED PROBLEMS;

EVOLUTIONARY ALGORITHMS;

EID: 33645557555     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.871250     Document Type: Article

References (59)

1. F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld, "Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem," in Proc. 6th Int. Conf. Genetic Algorithms, L. J. Eshelman, Ed., 1995, pp. 470-477.
2. S. Arora, C. Lund, R. Motwani, M. Sundan, and M. Szegedy, "Proof verification and the hardness of approximation problems," in Colloquium on Computational Complexity Report TR98-008. Trier, Germany: Univ. Trier, 1998.
3. A. Assad and W. Xu, "The quadratic minimum spanning tree problem," Naval Research Logistics, vol. 39, pp. 399-417, 1992.
4. J. C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Comput., vol. 6, no. 2, pp. 154-160, 1994.
5. B. Boldon, N. Deo, and N. Kumar, "Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine," Parallel Comput., vol. 22, pp. 369-382, 1996.
6. H. Chou, G. Premkumar, and C. H. Chu, "Genetic algorithms for communications network design-an empirical study of the factors that influence performance," IEEE Trans. Evol. Comput., vol. 5, no. 3, pp. 236-249, 2001.
7. B. Dengiz, F. Altiparmak, and A. E. Smith, "Local search genetic algorithm for optimal design of reliable networks," IEEE Trans. Evol. Comput., vol. 1, no. 3, pp. 179-188, 1997.
8. N. Deo and N. Kumar, "Computation of constrained spanning trees: A unified approach," Lecture Notes in Economics and Mathematical Systems, vol. 450, pp. 194-220, 1996.
9. M. Ebner, P. Langguth, J. Albert, M. Shackleton, and P. Shipman, "On neutral networks and evolvability," in Proc. 2001 CEC, 2001, pp. 1-8.
10. C. Eckert and J. Gottlieb, "Direct representation and variation operators for the fixed charge transportation problem," in Lecture Notes in Computer Science, vol. 2439, Proc. PPSN VII, 2002, pp. 77-87.
11. B. Freisleben and P. Merz, "A genetic local search algorithm for solving symmetric and asymmetric travelling salesmen problems," in Proc. of IEEE Int. Conf. Evol. Comput., 1996, pp. 616-621.
12. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979, pp. 73-80.
13. T. Gaube and F. Rothlauf, "The link and node biased encoding revisited: Bias and adjustment of parameters," in Proc. EvoWorkshop, vol. 2037, Lecture Notes in Computer Science, 2001, pp. 1-10.
14. M. Gen and R. Chen, Genetic Algorithms and Engineering Design. New York: Wiley, 1997.
15. J. Gottlieb, B. A. Julstrom, G. R. Raidl, and F. Rothlauf, "Prüfer numbers: A poor representation of spanning trees of evolutionary search," in Working Papers in Information Systems. Bayreuth, Germany: Univ. Bayreuth, 2000.
16. J. Gottlieb and C. Eckert, "A comparison of two representations for the fixed charge transportation problem," in Lecture Notes in Computer Science, vol. 1917, Proc. PPSN VI, 2000, pp. 345-354.
17. T. C. Hu, "Optimum communication spanning trees," SIAM J. Comput., vol. 3, no. 3, pp. 188-195, 1974.
18. B. A. Julstrom, "The blob code: A better string coding of spanning trees for evolutionary search," in Proc. Genetic and Evol. Comput. Conf., 2001, pp. 256-261.
19. B. Julstrom and G. Raidl, "Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges," in Proc. ACM Symp. Appl. Comput., 2002, pp. 547-552.
20. C. Palmer and A. Kershenbaum, "An approach to a problem in network design using genetic algorithms," Networks, vol. 26, pp. 151-163, 1995.
21. J. Knowles and D. Corne, "A new evolutionary approach to the degree-constrained minimum spanning tree problem," IEEE Trans. Evol. Comput., vol. 4, no. 2, pp. 25-134, 2000.
22. J. Knowles and R. A. Watson, "On the utility of redundant encodings in mutation-based evolutionary search," in Lecture Notes in Computer Science, vol. 2439, Proc. PPSN VII, 2002, pp. 88-98.
23. M. Krishnamoorthy, A. Ernst, and Y. Sharaiha, "Comparision of algorithms for the DC-MST," J. Heuristics, vol. 7, pp. 587-611, 2001.
24. J. B. Kruskal, "On the shortest spanning tree of a graph and the travelling salesman problem," in Proc. Amer. Math. Soc., vol. 7, 1956, pp. 48-50.
25. B. Manderick, M. de Weger, and P. Spiessens, "The genetic algorithm and the structure of the fitness landscape," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 143-150.
26. P. Merz and B. Freisleben, "Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning," Evol. Comput., vol. 8, no. 1, pp. 61-91, 2000.
27. S. C. Narula and C. A. Ho, "Degree-constrained minimum spanning tree," Comput. Oper. Res., vol. 7, pp. 239-249, 1980.
28. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," in Proc. IEEE Int. Conf. Evol. Comput., 1994, pp. 379-384.
29. C. C. Palmer and A. Kershenbaum, "An approach to a problem in network design using genetic algorithms," Networks, vol. 26, pp. 151-163, 1995.
30. C. C. Palmer, "An approach to a problem in network design using genetic algorithms," Ph.D. dissertation, Polytechnic Univ., Ann Arbor, MI, 1994.
31. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci., vol. 43, pp. 425-440, 1991.
32. D. Peleg and E. Reshef, "Deterministic polylog approximation for minimum communication spanning trees," in Proc. ICALP, vol. 1443, Lecture Notes in Computer Science, 1998, pp. 670-681.
33. S. Picciotto, "How to encode a tree," Ph.D. dissertation, Univ. California, San Diego, CA, 1999.
34. P. Piggott and F. Suraweera, "Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem," in Progress in Evolutionary Computation. Berlin, Germany: Springer-Verlag, 1995, pp. 305-314. LNAI 956.
35. R. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, 1957.
36. G. R. Raidl, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," in Proc. IEEE Int. Conf. Evol. Comput., 2000, pp. 104-111.
37. G. R. Raidl, "Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem," Vienna Univ. Technol., Vienna, Austria, Tech. Rep. TR-186-1-04-05, 2004.
38. G. R. Raidl and B. Julstrom, "Edge-sets: An effective evolutionary coding of spanning trees," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 225-239, 2003.
39. C. R. Reeves and T. Yamada, "Genetic algorithms, path relinking, and the flowshop sequencing problem," Evol. Comput., vol. 6, pp. 45-60.
40. F. Rothlauf, D. Goldberg, and A. Heinzl, "Network random keys - A tree network representation scheme for genetic and evolutionary algorithms," Evol. Comput., vol. 10, no. 1, pp. 75-97, 2002.
41. F. Rothlauf, D. Goldberg, and A. Heinzl, Representations for Genetic and Evolutionary Algorithms. Berlin, Germany: Springer-Verlag, 2002. Number 104 in Studies on Fuzziness and Soft Computing.
42. F. Rothlauf, J. Gerstacker, and A. Heinzl, "On the optimal communication spanning tree problem," in Working Papers in Information Systems: Univ. Mannheim, 2003.
43. F. Rothlauf, "Population Sizing for the redundant trivial voting mapping," in Working Papers in Information Systems. Mannheim, Germany: Univ. Mannheim, 2003.
44. F. Rothlauf and D. Goldberg, "Tree network design with genetic algorithms - An investigation in the locality of the prüfernumber encoding," in Proc. Late Breaking Papers at the Genetic and Evol. Comput. Conf., 1999, pp. 238-244.
45. B. Schindler, F. Rothlauf, and H. Pesch, "Evolution strategies, network random keys, and the one-max tree problem," in Evoworkshops. Berlin, Germany: Springer-Verlag, 2002, pp. 143-52.
46. P. Schuter, "Artificial life and molecular evolutionary biology," in Advances in Artificial Life, F. Moran, Ed. Berlin, Germany: Springer-Verlag, 1995, pp. 3-19.
47. B. Sendhoff, M. Kreutz, and W. V. Seelen, "A condition for the genotype-phenotype mapping: Casualty," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 73-80.
48. R. Shipman, M. Shackleton, and L. Harvey, "The use of neutral genotype-phenotype mappings for improved evolutionary search," British Telecom Technol. J., vol. 18, no. 4, pp. 103-111, 2000.
49. S.-M. Soak, D. Corne, and B.-H. Ahn, "A new encoding for the degree constrained minimum spanning tree problem," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2004, vol. 3213, Proc. KES, pp. 952-958.
50. S.-M. Soak, D. Corne, and B.-H. Ahn, "A recent encoding achieves progress on optimum communication spanning tree benchmark instances," Operations Research Letter, 2004. In review.
51. S.-M. Soak, D. Corne, and B.-H. Ahn, "On a property analysis of representations for constrained spanning tree problems," in Proc. 7th Int. Conf. Artif. Evol., 2005. In press.
52. C. Tzoppe, F. Rothlauf, and H. J. Pesch, "The edge-set encoding revisited: On the bias of a direct representation for trees," in Working Paper in Information Systems. Mannheim, Germany: Univ. Mannheim, Jan. 2004.
53. L. D. Whitley, T. Starkweather, and D. Fuquay, "Scheduling problems and traveling salesman: The genetic edge recombination," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 133-140.
54. B. Y. Wu, K. M. Chao, and C. Y. Tang, "Approximation algorithms for some optimum communication spanning tree problem," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1998, vol. 1533, Proc. ISAAC, pp. 407-416.
55. B. Y. Wu, K. M. Chao, and C. Y. Tang, "A polynomial time approximation scheme for optimal product-requirement communication spanning trees," J. Algorithms, vol. 36, pp. 182-204, 2000.
56. W. Xu, "On the quadratic minimum spanning tree problem," in Proc. 3rd Int. Conf. Genetic Algorithms, J. Schaffer, Ed., 1995, pp. 141-148.
57. G. Zhou and M. Gen, "A note on genetic algorithms for degree-constrained spanning tree problems," Networks, vol. 30, pp. 91-95, 1997.
58. G. Zhou and M. Gen, "An effective GA approach to the quadratic minimum spanning tree problem," Comput. Oper. Res., vol. 25, no. 3, pp. 229-237, 1998.
59. G. Zhou and M. Gen, "Genetic algorithm approach on multi-criteria minimum spanning tree problem," Eur. J. Oper. Res., vol. 114, pp. 141-152, 1999.