Abstract
Continuous Estimation of Distribution Algorithms (EDAs) commonly use a Gaussian distribution to control the search process. For high-dimensional optimization problems, several practical issues arise when estimating a large covariance matrix from the selected population. Recent work in continuous EDAs has aimed to address these issues. The Screening Estimation of Distribution Algorithm (sEDA) is one such algorithm which, uniquely, utilizes the objective function values obtained during the search. A sensitivity analysis technique is then used to reduce the rank of the covariance matrix, according to the estimated sensitivity of the fitness function to individual variables in the search space.
In this paper we analyze sEDA and find that it does not scale well to very high-dimensional problems because it uses a large number of additional fitness function evaluations per generation. A modified version of the algorithm, named sEDA-lite is proposed which requires no additional fitness evaluations for sensitivity analysis. Experiments on a variety of artificial and real-world representative problems evaluate the performance of the algorithm compared with sEDA and EDA-MCC, a related, recently proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bosman, P.A.N., Grahl, J., Thierens, D.: Enhancing the performance of maximum–likelihood gaussian eDAs using anticipated mean shift. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN X. LNCS, vol. 5199, pp. 133–143. Springer, Heidelberg (2008)
Bosman, P.A.N.: On empirical memory design, faster selection of Bayesian factorizations and parameter-free Gaussian EDAs. In: Raidl, G., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference — GECCO–2009, pp. 389–396. ACM Press, New York (2009)
Brimberg, J., Hansen, P., Mladenovic, N., Taillard, E.D.: Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Operations Research 48(3), 444–460 (2000)
Campolongo, F., Cariboni, J., Saltelli, A.: An effective screening design for sensitivity analysis of large models. Environmental Modelling & Software 22(10), 1509–1518 (2007)
Dong, W., Chen, T., Tino, P., Yao, X.: Scaling up Estimation of Distribution Algorithms for continuous optimization. IEEE Transactions 17(6), 797–822 (2013)
Dong, W., Yao, X.: Covariance matrix repairing in Gaussian based EDAs. In: IEEE Congress on Evolutionary Computation (CEC), pp. 415–422. IEEE (2007)
Dong, W., Yao, X.: Unified eigen analysis on multivariate Gaussian based Estimation of Distribution Algorithms. Information Sciences 178(15), 3000–3023 (2008)
Eiben, A.E., Smith, J.E.: Multimodal problems and spatial distribution. In: Introduction to Evolutionary Computing, pp. 153–172. Springer (2003)
Eilon, S., Watson-Gandy, C.D.T., Christofides, N.: Distribution management: mathematical modelling and practical analysis. Griffin, London (1971)
Hansen, N.: The CMA evolution strategy: a comparing review. In: Towards a New Evolutionary Computation, pp. 75–102. Springer (2006)
Karshenas, H., Santana, R., Bielza, C., Larrañaga, P.: Regularized continuous Estimation of Distribution Algorithms. Applied Soft Computing (2012)
King, D.M., Perera, B.J.C.: Morris method of sensitivity analysis applied to assess the importance of input variables on urban water supply yield–a case study. Journal of Hydrology 477, 17–32 (2013)
Larrañaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer (2001)
Mishra, K.M., Gallagher, M.: Variable screening for reduced dependency modelling in gaussian-based continuous estimation of distribution algorithms. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2012)
Morris, M.D.: Factorial sampling plans for preliminary computational experiments. Technometrics 33(2), 161–174 (1991)
Pelikan, M., Goldberg, D.E., Lobo, F.G.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5–20 (2002)
Salhi, S., Gamal, M.D.H.: A genetic algorithm based approach for the uncapacitated continuous location–allocation problem. Annals of Operations Research 123(1), 203–222 (2003)
Scaparra, M.P., Scutellà , M.G.: Facilities, locations, customers: Building blocks of location models. a survey. Technical Report TR-01-18, Universits’ degli Studi di Pisa (2001)
Hansen, N., Büche, D., Ocenasek, J., Kern, S., Müller, S.D., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms–a comparative review. Natural Computing 3(1), 77–112 (2004)
Wagner, M., Auger, A., Schoenauer, M.: EEDA: A new robust estimation of distribution algorithms. Technical Report INRIA RR-5190 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Mishra, K.M., Gallagher, M. (2014). A Modified Screening Estimation of Distribution Algorithm for Large-Scale Continuous Optimization. In: Dick, G., et al. Simulated Evolution and Learning. SEAL 2014. Lecture Notes in Computer Science, vol 8886. Springer, Cham. https://doi.org/10.1007/978-3-319-13563-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-13563-2_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13562-5
Online ISBN: 978-3-319-13563-2
eBook Packages: Computer ScienceComputer Science (R0)