A new evolutionary approach for the optimal communication spanning tree problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 10, 2006, Pages 2882-2893

  Soak, Sang Moon ^a  

^a Korea Intellectual Property Office   (South Korea)

Author keywords

Evolutionary algorithm; Genetic encoding method; Optimum communication spanning tree problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); INFORMATION THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

GENETIC ENCODING METHOD; OPTIMUM COMMUNICATION SPANNING TREE PROBLEM; TREE CONSTRUCTION ROUTINE (TCR);

EVOLUTIONARY ALGORITHMS;

EID: 33750066364     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.10.2882     Document Type: Conference Paper

References (35)

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," Proc. 6th Int. Conf. on Genetic Algorithms, pp.470-477, 1995.
2. S. Arora, C. Lund, R. Motwani, M. Sundan, and M. Szegedy, "Proof varification and the hardness of approximation problems," Collo quium on Computational Complexity Report TR98-008, Univ. of Trier.
3. J.C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Computing, vol.6, no.2, pp.154-160, 1994.
4. 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.
5. C. Eckert and J. Gottlieb, "Direct representation and variation operators for the fixed charge transportation problem," Proc. PPSN VII, LNCS 2439, pp.77-87, 2002.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
7. T. Gaube and F. Rothlauf, "The link and node biased encoding revisited: Bias and adjustment of parameters," EvoWorkshop 2001, LNCS 2037, pp.1-10, 2001.
8. M. Gen and R. Chen, Genetic Algorithms and Engineering Design, Wiley, 1997.
9. J. Gottlieb, B.A. Julstrom, G.R. Raidl, and F. Rothlauf, "Prüfer numbers: A poor representation of spanning trees of evolutionary search," Working Papers in Information Systems, Univ. of Bayreuth, 2000.
10. J. Gottlieb and C. Eckert, "A comparision of two representations for the fixed charge transportation problem," Proc. PPSN VI, LNCS 1917, pp.345-354, 2000.
11. T.C. Hu, "Optimum communication spanning trees," SIAM J. Comput., vol.3, no.3, pp.188-195, 1974.
12. Y. Li, "An effective implementation of a direct spanning tree representation in GAs," EvoWorkshop 2001, LNCS 2037, pp. 11-19, 2001.
13. M. Krishnamoorthy, A. Ernst, and Y. Sharaiha, "Comparision of algorithms forme DC-MST," J. Heuristics, vol.7, pp.587-611, 2001.
14. J.B. Kruskal, "On the shortest spanning tree of a graph and the travelling salesman problem," Proc. American Mathematical Society, vol.7, no.1, pp.48-50, 1956.
15. Y. Li and Y. Bouchebaba, "A new genetic algorithm for the optimal communication spanning tree problem," Proc. Artificial Evolution, pp.162-173, 1999.
16. 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.
17. C.C. Palmer and A. Kershenbaum, "Representating trees in genetic algorithms," Int. Conf. Evolutionary Computation, pp.379-384, 1994.
18. C.C. Palmer and A. Kershenbaum, "An approach to a problem in network design using genetic algorithms," Networks, vol.26, pp. 151-163, 1995.
19. C.H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci., vol.43, pp.425-440, 1991.
20. D. Peleg and E. Reshef, "Deterministic polylog approximation for minimum communication spanning trees," ICALP'98, LNCS 1443, pp.670-681, 1998.
21. G.R. Raidl, "An effecient evolutionary algorithm for the degree-constrained minimum spanning tree problem," Proc. IEEE CEC, pp. 104-111, 2000.
22. 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.
23. C.R. Reeves and T. Yamada, "Genetic algorithms, path relinking, and the flowshop sequencing problem," Evol. Comput., vol.6, pp.45-60.
24. F. Rothlauf, D.E. 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.
25. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms, Studies on Fuzziness and Soft Computing 104, Springer, Berlin, 2002.
26. F. Rothlauf, J. Gerstacker, and A. Heinzl, "On the optimal communication spanning tree problem," Working Papers in Information Systems, Univ. of Mannheim, 2003.
27. F. Rothlauf, "On the locality of representations," Working Paper in Information Systems, Univ. of Mannheim, 2003.
28. B. Schindler, F. Rothlauf, and H.J. Pesch, "Evolution strategies, network random keys, and the one-max tree problem," Evo'02, LNCS 2279, pp.143-152, 2002.
29. S.M. Soak, D. Corne, and B.H. Ahn, "A new encoding for the degree constrained minimum spanning tree problem," KES 2004, LNAI, vol.3213, pp.952-958, 2004.
30. S.M. Soak, D. Corne, and B.H. Ahn, "A powerful new encoding for tree-based combinatorial optimisation problem," Proc. PPSN VII, LNCS 3242, pp.430-439, 2004.
31. C. Tzoppe, F. Rothlauf, and H.J. Pesch, "The edge-set encoding revisited: On the bias of a direct representation for trees," Working Paper in Information Systems, Univ. of Mannheim, Jan. 2004.
32. J.P. Watson, L. Barbulescu, L.D. Whitley, and A.E. Howe, "Constrasting structured and random permutation flow-shop scheduling problems: Search-space topology and algorithm performance," http://www.cs.colostate.edu/~genitor/Pubs.html
33. L.D. Whitley, T. Starkweather, and D. Fuquay, "Scheduling problems and traveling salesman: The genetic edge recombination," Proc. 3rd Int. Conf. on Genetic Algorithms, pp. 133-140, 1989.
34. B.Y. Wu, K.M. Chao, and C.Y. Tang, "Approximation algorithms for some optimum communication spanning tree problem," ISAAC'98, LNCS 1533, pp.407-416, 1998.
35. 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.