Performance analysis of evolutionary algorithms for the minimum label spanning tree problem

IEEE Transactions on Evolutionary Computation

Volumn 18, Issue 6, 2014, Pages 860-872

  Lai, Xinsheng ^a,b   Zhou, Yuren ^a   He, Jun ^c   Zhang, Jun ^d,e,f  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b SHANGRAO NORMAL UNIVERSITY   (China)

^c ABERYSTWYTH UNIVERSITY   (United Kingdom)

^d SUN YAT SEN UNIVERSITY   (China)

^e BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^f Key Laboratory of Software Technology   (China)

Author keywords

approximation ratio; Evolutionary algorithm; minimum label spanning tree; multi objective; runtime complexity

Indexed keywords

APPROXIMATION ALGORITHMS; PARALLEL ARCHITECTURES; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

APPROXIMATION RATIOS; EVOLUTIONARY ALGORITHMS (EAS); EXPERIMENTAL INVESTIGATIONS; MULTI OBJECTIVE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; RUN TIME COMPLEXITY; SPANNING TREE; SPANNING TREE PROBLEMS;

EVOLUTIONARY ALGORITHMS;

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

References (44)

1. A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ, USA: Prentice Hall, 1989.
2. R.-S. Chang and S.-J. Leu, "The minimum labeling spanning trees," Inform. Process. Lett., vol. 63, no. 5, pp. 277-282, 1997.
3. A. Chwatal, G. Raidl, and O. Dietzel, "Compressing fingerprint templates by solving an extended minimum label spanning tree problem," in Proc. 7th MIC, 2007, pp. 105.1-105.3.
4. A. Chwatal, G. Raidl, and K. Oberlechner, "Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates," J. Math. Mod. Algor., vol. 8, no. 3, pp. 293-334, 2009.
5. J. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI, USA: Univ. Michigan Press, 1975.
6. D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. New York, NY, USA: Addison-Wesley, 1989.
7. F. Herrera, M. Lozano and J. Verdegay, "Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis," Artif. Intell. Rev., vol. 12, no. 4, pp. 265-319, 1998.
8. K. Gallagher and M. Sambridge, "Genetic algorithms: A powerful tool for large-scale non-linear optimization problems," Comput. Geosci., vol. 20, nos. 7-8, pp. 1229-1236, 1994.
9. Y. Xiong, B. Golden, and E. Wasil, "A one-parameter genetic algorithm for the minimum labeling spanning tree problem," IEEE Trans. Evol. Comput., vol. 9, no. 1, pp. 55-60, Feb. 2005.
10. J. Nummela and B. Julstrom, "An effective genetic algorithm for the minimum-label spanning tree problem," in Proc. GECCO, 2006, pp. 553-558.
11. S. Consoli and J. Moreno-Pérez, "Solving the minimum labelling spanning tree problem using hybrid local search," in Proc. Euro. MEC, vol. 39, 2012, pp. 75-82.
12. A. Chwatal and G. Raidl, "Solving the minimum label spanning tree problem by mathematical programming techniques," Vienna Univ. Technol., Inst. Comput. Graph. Algorithms, Vienna, Autria, Tech. Rep. TR 186-1-10-03, Jun. 2010.
13. R. Cerulli, A. Fink, M. Gentili, and S. Voß, "Metaheuristics comparison for the minimum labelling spanning tree problem," in The Next Wave on Computing, Optimization, and Decision Technologies, B. L. Golden, S. Raghavan, E. A. Wasil, eds. New York, NY, USA: Springer, 2005, pp. 93-106.
14. S. Consoli, K. Darby-Dowman, N. Mladenovíc, and J. Moreno-Pérez, "Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem," Eur. J. Oper. Res., vol. 196, no. 2, pp. 440-449, Jul. 2009.
15. S. O. Krumke and H. Wirth, "On the minimum label spanning tree problem," Inform. Process. Lett., vol. 66, no. 2, pp. 81-85, 1998.
16. Y. Wan, G. Chen, and Y. Xu, "A note on the minimum label spanning tree," Inform. Process. Lett., vol. 84, no. 2, pp. 99-101, 2002.
17. Y. Xiong, B. Golden, and E. Wasil, "Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem," Oper. Res. Lett., vol. 33, no. 1, pp. 77-80, 2005.
18. S. Jansen and I. Wegener, "Evolutionary algorithms: How to cope with plateaus of constant fitness and when to reject strings of the same fitness," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 589-599, Dec. 2001.
19. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artif. Intell., vol. 127, no. 1, pp. 57-85, 2001.
20. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1+1) evolutionary algorithm," Theor. Comput. Sci., vol. 276, nos. 1-2, pp. 51-81, 2002.
21. J. He and X. Yao, "Towards an analytic framework for analysing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, nos. 1-2, pp. 59-97, 2003.
22. F. Neumann, J. Reichel, and M. Skutella, "Computing minimum cuts by randomized search heuristics," Algorithmica, vol. 59, no. 3, pp. 323-342, 2011.
23. Y. Zhou, J. He, and Q. Nie, "A comparative runtime analysis of heuristic algorithms for satisfiability problems," Artif. Intell., vol. 173, no. 2, pp. 240-257, 2009.
24. F. Neumann and I. Wegener, "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem," Theor. Comput. Sci., vol. 378, no. 1, pp. 32-40, 2007.
25. F. Neumann, "Expected runtimes of evolutionary algorithms for the Eulerian cycle problem," Comput. Oper. Res., vol. 35, no. 9, pp. 2750-759, 2008.
26. A. Sutton and F. Neumann, "A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem," in Proc. 26th Conf. AAAI, 2012, pp. 1105-1111.
27. O. Giel and I. Wegener, "Evolutionary algorithms and the maximum matching problem," in Proc. 20th Annu. STACS, 2003, vol. 2607, pp. 415-426.
28. P. Oliveto, J. He, and X. Yao, "Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems," IEEE Trans. Evol. Comput., vol. 13, no. 5, pp. 1006-1029, Oct. 2009.
29. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt, "Approximating covering problems by randomized search heuristics using multiobjective models," Evol. Comput., vol. 18, no. 4, pp. 617-633, 2010.
30. C. Witt, "Worst-case and average-case approximations by simple randomized search heuristics," in Proc. 22nd Annu. STACS, 2005, vol. 3404, pp. 44-56.
31. F. Neumann and J. Reichel, "Approximating minimum multicuts by evolutionary multiobjective algorithms," in Proc. 10th Int. Conf. PPSN, 2008, pp. 72-81.
32. Y. Yu, X. Yao, and Z. Zhou, "On the approximation ability of evolutionary optimization with application to minimum set cover," Artif. Intell., vols. 180-181, pp. 20-33, Apr. 2012.
33. F. Neumann and I. Wegener, "Minimum spanning trees made easier via multiobjective optimization," Natural Comput., vol. 5, no. 3, pp. 305-319, 2006.
34. F. Neumann, "Expected runtimes of a simple evolutionary algorithm for the multiobjective minimum spanning tree problem," Eur. J. Oper. Res., vol. 181, no. 3, pp. 1620-1629, 2007.
35. C. Qian, Y. Yu, and Z.-H. Zhou, "An analysis on recombination in multiobjective evolutionary optimization," Artif. Intell., vol. 204, pp. 99-119, Nov. 2013.
36. T. Brüggemann, J. Monnot, and G. Woeginger, "Local search for the minimum label spanning tree problem with bounded color classes," Oper. Res. Lett., vol. 31, no. 3, pp. 195-201, 2003.
37. O. Giel, "Expected runtimes of a simple multiobjective evolutionary algorithm," in Proc. IEEE Congr. Evol. Comput., 2003, pp. 1918-1925.
38. M. Laumanns, L. Thiele, and E. Zitzler, "Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 170-182, Apr. 2004.
39. M. Mitzenmacher and E. Upfal, Propability and Computing. Cambridge, U.K.: Cambridge Univ. Press, 2005.
40. T. Jansen, K. A. D. Jong, and I. Wegener, "On the choice of the offspring population size in evolutionary algorithms," Evol. Comput., vol. 13, no. 4, pp. 413-440, 2005.
41. T. Chen, J. He, G. Sun, G. Chen, and X. Yao, "A new approach to analyzing average time complexity of population-based evolutionary algorithms on unimodal problems," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 39, no. 5, pp. 1092-1106, Oct. 2009.
42. T. Chen, K. Tang, G. Chen, and X. Yao, "A large population size can be unhelpful in evolutionary algorithms," Theor. Comput. Sci., vol. 436, no. 8, pp. 54-70, 2012.
43. T. Jansen and I. Wegener, "Real royal road functions-Where crossover provably is essential," Discrete Appl. Math., vol. 149, pp. 111-125, 2005.
44. B. Doerr, E. Happ, and C. Klein, "Crossover can provably be useful in evolutionary computation," Theor. Comput. Sci., vol. 425, pp. 17-33, 2012.