Abstract
While the gap between theory and practice is slowly closing, the evolutionary computation community needs to concentrate more heavily on the middle ground. This paper defends the position that contemporary analytical tools facilitate such a concentration. Empirical research can be improved by considering modern analytical techniques in experimental design. In addition, formal analytical extensions of empirical works are possible. We justify our position by way of a constructive example: we consider a recent empirically-based research paper and extend it using modern techniques of asymptotic analysis of run time performance of the algorithms and problems investigated in that paper. The result is a more general understanding of the performance of these algorithms for any size of input, as well as a better understanding of the underlying reasons for some of the previous results. Moreover, our example points out how important it is that empirical researchers motivate their parameter choices more clearly. We believe that providing theorists with empirical studies that are well-suited for formal analysis will help bridge the gap between theory and practice, benefitting the empiricist, the theorist, and the community at large.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51–81 (2002)
He, J., Yao, X.: From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. Evolutionary Computation 6(5), 495–511 (2002)
Jansen, T., De Jong, K.A.: An analysis of the role of offspring population size in EAs. In: Genetic and Evolutionary Computation Conf (GECCO 2002), pp. 238–246. Morgan Kaufmann, San Francisco (2002)
Jansen, T., Wegener, I.: On the utility of populations. In: Genetic and Evolutionary Computation Conf. GECCO 2001, pp. 1034–1041. Morgan Kaufmann, San Francisco (2001)
Jansen, T., Wegener, I.: On the analysis of evolutionary algorithms – a proof that crossover really can help. Algorithmica 34(1), 47–66 (2002)
Jansen, T., Wegener, I.: Real royal road – where crossover provably is essential. To appear in Discrete Applied Mathematics (2004)
Jansen, T., Wiegand, R.P.: Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 310–321. Springer, Heidelberg (2003)
Jansen, T., Wiegand, R.P.: Sequential versus parallel cooperative coevolutionary (1+1) EAs. In: Congress on Evolutionary Computation (CEC 2003), pp. 30–37. IEEE Press, Los Alamitos (2003)
Jansen, T., Wiegand, R.P.: The cooperative coevolutionary (1+1) EA. Accepted for Evolutionary Computation (2004)
Potter, M.A., De Jong, K.A.: A cooperative coevolutionary approach to function optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249–257. Springer, Heidelberg (1994)
Rabani, Y., Rabinovich, Y., Sinclair, A.: A computational view of population genetics. Random Structures and Algorithms 12(4), 313–334 (1998)
Storch, T., Wegener, I.: Real royal road functions for constant population size. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1406–1417. Springer, Heidelberg (2003)
Wiegand, R.P., Liles, B., De Jong, K.A.: 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. 257–270. Springer, Heidelberg (2002)
Witt, C.: Population size vs. runtime of a simple EA. In: Congress on Evolutionary Computation (CEC 2003), pp. 1996–2003. IEEE Press, Los Alamitos (2003)
Witt, C.: An analysis of the (μ+1) EA on simple pseudo-boolean functions. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 761–773. Springer, Heidelberg (2004)
Bull, L.: Evolutionary Computing in Multi-agent Environments: Partners. In: Int’l Conf. on Genetic Algorithms (ICGA 1997), pp. 370–377. Morgan Kaufmann, San Francisco (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, T., Wiegand, R.P. (2004). Bridging the Gap Between Theory and Practice. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30217-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23092-2
Online ISBN: 978-3-540-30217-9
eBook Packages: Springer Book Archive