Node-based genetic algorithm for communication spanning tree problem

IEICE Transactions on Communications

Volumn E89-B, Issue 4, 2006, Pages 1091-1098

  Lin, Lin ^a   Gen, Mitsuo ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

Communication network design; Genetic algorithm (GA); Minimum spanning tree (MST); Node based encoding

Indexed keywords

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); INTEGRATED CIRCUIT LAYOUT; PROBLEM SOLVING; TELECOMMUNICATION SYSTEMS; TREES (MATHEMATICS);

COMMUNICATION NETWORK DESIGN; MINIMUM SPANNING TREE (MST); MUTATION OPERATORS; NODE-BASED ENCODING; SET-BASED ENCODING;

GENETIC ALGORITHMS;

EID: 33646255104     PISSN: 09168516     EISSN: 17451345     Source Type: Journal    
DOI: 10.1093/ietcom/e89-b.4.1091     Document Type: Article

References (41)

1. R. Boorstyn and H. Frank. "Large-scale network topological optimization," IEEE Trans. Commun., vol.COM-25, no. 1, pp.29-47, 1977.
2. M. Gen, R. Cheng, and S.S. Oren, "Network design techniques using adapted genetic algorithms," Advances in Engineering Software, vol.32, no.9, pp.731-744, 2001.
3. L. Gouveia and P. Martins, "The capacitated minimum spanning tree problem: Revisiting hop-indexed formulations." Computers & Operations Research, vol.23, pp.2435-2452, 2005.
4. Y. Lee and M. Atiquzzaman, "Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem," Comput. Commun., vol.28, pp.1371-1379.,2005.
5. R. Montemanni and L.M. Gambardella, "A Benders decomposition approach for the robust spanning tree problem with interval data," Euro. J. Oper. Res., vol.161, no.3, pp.771-779, 2005.
6. J. Crichigno and B. Baran, "Multiobjective multicast routing algorithm for traffic engineering," Proc. 13th Int. J. of Computer Communications and Networks, pp.301-306, 2004.
7. M. Gen, A. Kumar, and R. Kim, "Recent network design techniques using evolutionary algorithms," Int. J. Production Economics, vol.98, no.2, pp.251-261, 2005.
8. L. Lin and M. Gen, "Bicriteria network design problem using interactive adaptive-weight GA and priority-based encoding method," IEEE Trans. Evol. Comput., Jan. 2005 (in Reviewing).
9. F. Abuali, R. Wainwright, and D. Schoenefeld, "Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem," Proc. 6th Int. Conf. Genetic Algorithms, pp.470-475, 1995.
10. G. Zhou and M. Gen, "An effective genetic algorithm approach to the quadratic minimum spanning tree problem," Computers & Operations Research, vol.25, no.3, pp.229-247, 1998.
11. G. Zhou and M. Gen. "Leaf-constrained spanning tree problem with genetic algorithms approach," Beijing Mathematics, vol.7, no.2, pp.50-62, 1998.
12. L.M. Fernandes and L. Gouveia, "Minimal spanning trees with a constraint on the number of leaves," Euro. J. Oper. Res., vol.104, pp.250-261, 1998.
13. G. Raidi and C. Drexe, "A predecessor coding in an evolutionary algorithm for the capacitated minimum spanning tree problem," Proc. GECCO, pp. 309-316, 2000.
14. R. Ahuja and J. Orlin, "Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem," Mathematical Programming, vol.91, pp.71-97, 2001.
15. G. Zhou and M. Gen, "Approach to degree-constrained minimum spanning tree problem using genetic algorithm," Engineering Design and Automation, vol.3, no.2, pp.157-165, 1997.
16. G. Zhou and M. Gen, "A note on genetic algorithm approach to the degree-constrained spanning tree problems," Networks, vol.30, pp. 105-109, 1997.
17. G. Zhou and M. Gen, "Approach to degree-constrained minimum spanning tree problem using genetic algorithm," in Genetic algorithms & Engineering Design, M. Gen and R. Chen, John Wiley, New York, 2000.
18. G. Raidi, "A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem," Proc. SAC(1). pp.440-445, 2000.
19. G. Raidi, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," Proc. Congress on Evol. Comput., vol.1, pp.104-111, 2000.
20. 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. 125-134, 2000.
21. H. Chou, G. Premkumar, and C. 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.
22. G.R. Raidl and B.A. Julstrom, "Edge sets: An effective evolutionary coding of spanning trees," IEEE Trans. Evol. Comput., vol.7, no.3, pp.225-239, June 2003.
23. G. Raidl and B. Julstrom, "Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem," Proc. SAC, pp.747-752, 2003.
24. B. Julstrom, "A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem," Proc. GECCO, pp.2-7, 2003.
25. G. Zhou and M. Gen, "Genetic algorithm approach on multi-criteria minimum spanning tree problem," Euro. J. Oper. Res., vol.114, no. 1, pp. 141-152, 1999.
26. M. Gen, G. Zhou, and M. Takayama, "Matrix-based genetic algorithm approach on bicriteria minimum spanning tree problem with interval coefficients," J. of Japan Society for Fuzzy Theory and Systems, vol.10, no.6, pp.643-656, 2000.
27. 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.125-134, 2000.
28. C. Lo and W. Chang, "A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem," IEEE Trans. Syst. Man Cybern., vol.30, no.3, pp.461-170, 2000.
29. F. Neumann, "Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem," Proc. 8th Inter. Conf. of Parallel Problem Solving from Nature, pp.80-89, 2004.
30. B. Julstrom and G. Raidl, "Weight-biased edge-crossover in evolutionary algorithms for two graph problems," Proc. 16th ACM Symposium on Applied Computing, pp.321-326, Las Vegas, NV.,2001.
31. B. Schindler, F. Rothlauf, and H. Pesch, "Evolution strategies, network random keys, and the one-max tree problem," Proc. Applic. of Evol. Computing on EvoWorkshops, pp. 143-152, 2002.
32. F. Rothlauf, D. Goldberg, and A. Heinz, "Network random keys a tree network representation scheme for genetic and evolutionary algorithms," Evol. Comput. Spring, vol.10, no.1, pp.75-97, 2002.
33. F. Rothlauf, J. Gerstacker, and A. Heinzl, "On the optimal communication spanning tree problem," Working Paper 10/2003, Univ. of Mannheim, 2003.
34. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, New York, 1997.
35. M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization, John Wiley & Sons, New York, 2000.
36. L. Davis, D. Orvosh, A. Cox, and Y. Qiu, "A genetic algorithm for survivable network design," Proc. 5th Int. Conf. Genetic Algorithms, pp.408-415, 1993.
37. P. Piggott and F. Suraweera, "Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem," Progress in Evol. Comput., ed. X. Yao, vol.956, LNAI, pp.305-314, Springer, New York, 1995.
38. J.C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Comput., vol.6, no.2, pp. 154-160, 1994.
39. A. Cayley, "A theorem on tree," Quart. J. Math., vol.23, pp.376-378, 1889.
40. H. Prüfer, "Neuer bewis eines Satzes über Permutationnen," Arch. Math. Phys., vol.27, pp.742-744, 1918.
41. OR-Library. [Online]: http://www.brunel.ac.uk/depts/ma/research/-jeb/ info.html