Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem
Evolutionary algorithms are applied to problems that are not well understood as well as to problems in combinatorial optimization. The analysis of these search heuristics has been started for some well-known polynomial solvable problems. Such analyses are starting points for the analysis of evolutionary algorithms of difficult problems. We consider the NP-hard multi-objective minimum spanning tree problem and give upper bounds on the expected time until a simple evolutionary algorithm has produced a population including for each extremal point of the Pareto Front a corresponding spanning tree.
Unable to display preview. Download preview PDF.
- 2.Scharnow, J., Tinnefeld, K., Wegener, I.: Fitness landscapes based on sorting and shortest paths problems. In: IWDW 2003, vol. 2939, pp. 54–63 (2002)Google Scholar
- 4.Neumann, F.: Expected Runtimes of evolutionary algorithms for the Eulerian cycle problem. Accepted for CEC 2004 (2004)Google Scholar
- 6.Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., Deb, K.: Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 44–53. Springer, Heidelberg (2002)CrossRefGoogle Scholar
- 7.Giel, O.: Expected Runtimes of a Simple Multi-objective Evolutionary Algorithm. In: Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003), pp. 1918–1925 (2003)Google Scholar
- 9.Knowles, J.D., Corne, D.W.: A comparison of encodings and algorithms for multiobjective minimum spanning tree problems. CEC 2001 (2001)Google Scholar