Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches (2306.16686v1)

Published 29 Jun 2023 in cs.NE

Abstract: In many applications of evolutionary algorithms the computational cost of applying operators and storing populations is comparable to the cost of fitness evaluation. Furthermore, by knowing what exactly has changed in an individual by an operator, it is possible to recompute fitness value much more efficiently than from scratch. The associated time and memory improvements have been available for simple evolutionary algorithms, few specific genetic algorithms and in the context of gray-box optimization, but not for all algorithms, and the main reason is that it is difficult to achieve in algorithms using large arbitrarily structured populations. This paper makes a first step towards improving this situation. We show that storing the population as a minimum spanning tree, where vertices correspond to individuals but only contain meta-information about them, and edges store structural differences, or patches, between the individuals, is a viable alternative to the straightforward implementation. Our experiments suggest that significant, even asymptotic, improvements -- including execution of crossover operators! -- can be achieved in terms of both memory usage and computational costs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. Fast mutation in crossover-based algorithms. Algorithmica, 84(6):1724–1761, 2022.
  2. Critical evaluation of sine cosine algorithm and a few recommendations. In Proceedings of Genetic and Evolutionary Computation Conference Companion, pages 319–320, 2020.
  3. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, 2000.
  4. A. Bassin and M. Buzdalov. The (1+(λ,λ))1𝜆𝜆(1+(\lambda,\lambda))( 1 + ( italic_λ , italic_λ ) ) genetic algorithm for permutations. In Proceedings of Genetic and Evolutionary Computation Conference Companion, pages 1669–1677. ACM, 2020.
  5. Achieving highly scalable evolutionary real-valued optimization by exploiting partial evaluations. Evolutionary Computation, 29(1):129–155, 2021.
  6. Exploiting linkage information in real-valued optimization with the real-valued gene-pool optimal mixing evolutionary algorithm. In Proceedings of Genetic and Evolutionary Computation Conference, pages 705–712, 2017.
  7. N. Bulanova and M. Buzdalov. On binary unbiased operators returning multiple offspring. In Proceedings of Genetic and Evolutionary Computation Conference Companion, pages 1395–1398, 2017.
  8. M. Buzdalov and B. Doerr. Runtime analysis of the (1+(λ,λ))1𝜆𝜆(1+(\lambda,\lambda))( 1 + ( italic_λ , italic_λ ) ) genetic algorithm on random satisfiable 3-CNF formulas. In Proceedings of Genetic and Evolutionary Computation Conference, pages 1343–1350, 2017.
  9. E. Carvalho Pinto and C. Doerr. A simple proof for the usefulness of crossover in black-box optimization. In Parallel Problem Solving from Nature – PPSN XV, Vol. 2, number 11102 in Lecture Notes in Computer Science, pages 29–41. 2018.
  10. E. Carvalho Pinto and C. Doerr. Towards a more practice-aware runtime analysis of evolutionary algorithms. https://arxiv.org/abs/1812.00493, 2018.
  11. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In Proceedings of Genetic and Evolutionary Computation Conference, pages 753–760, 2017.
  12. Efficient identification of improving moves in a ball for pseudo-Boolean problems. In Proceedings of Genetic and Evolutionary Computation Conference, pages 437–444, 2014.
  13. F. Chin and D. Houck. Algorithms for updating minimal spanning trees. Journal of Computer and System Sciences, 16:333–344, 1978.
  14. P. Chu and J. Beasley. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4(1):63–86, 1998.
  15. D. Corus and P. S. Oliveto. On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica, 82:3676–3706, 2020.
  16. Escaping local optima using crossover with emergent diversity. IEEE Transactions on Evolutionary Computation, 22(3):484–497, 2018.
  17. K. Deb and C. Myburgh. A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables. European Journal of Operational Research, 261(2):460–474, 2017.
  18. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182–197, 2002.
  19. From black-box complexity to designing new genetic algorithms. Theoretical Computer Science, 567:87–104, 2015.
  20. Lasting diversity and superior runtime guarantees for the (μ+1)𝜇1(\mu+1)( italic_μ + 1 ) genetic algorithm, 2023.
  21. Faster black-box algorithms through higher arity operators. In Proceedings of Foundations of Genetic Algorithms, pages 163–172, 2011.
  22. B. Doerr and C. Winzen. Reducing the arity in unbiased black-box complexity. Theoretical Computer Science, 545:108–121, 2014.
  23. B. Doerr and W. Zheng. Working principles of binary differential evolution. Theoretical Computer Science, 801:110–142, 2020.
  24. DEAP: Evolutionary algorithms made easy. Journal of Machine Learning Research, 13:2171–2175, 2012.
  25. J. E. Gentle. Random Number Generation and Monte Carlo Methods. Springer, 2nd edition, 2003.
  26. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9:159–195, 2001.
  27. Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems. Applied Soft Computing, 11(8):5755–5769, 2011.
  28. W. Hörmann. The generation of binomial random variates. Journal of Statistical Computation and Simulation, 46(1-2):101–110, 1993.
  29. T. Jansen and C. Zarges. Analysis of evolutionary algorithms: From computational complexity analysis to algorithm engineering. In Proceedings of Foundations of Genetic Algorithms, pages 1–14, 2011.
  30. V. Kachitvichyanukul and B. W. Schmeiser. Binomial random variate generation. Communications of the ACM, 31(2):216–222, 1988.
  31. S. Kirkpatrick and B. Selman. Critical behavior in the satisfiability of random Boolean expressions. Science, 264(5163):1297–1301, 1994.
  32. P. K. Lehre and C. Witt. Black-box search by unbiased variation. Algorithmica, 64:623–642, 2012.
  33. Reproducibility in evolutionary computation. ACM Transactions on Evolutionary Learning and Optimization, 1(4):14:1–14:21, 2021.
  34. G. Marsaglia and W. W. Tsang. The ziggurat method for generating random variables. Journal of Statistical Software, 5(8), 2000.
  35. Redesigning the jMetal multi-objective optimization framework. In Proceedings of Genetic and Evolutionary Computation Conference Companion, pages 1093–1100, 2015.
  36. Tight bounds on the expected runtime of a standard steady state genetic algorithm. Algorithmica, 84:1603–1658, 2022.
  37. D. Pisinger. Algorithms for Knapsack Problems. PhD thesis, University of Copenhagen, 2 1995.
  38. E. Pitzer and M. Affenzeller. Cheating like the neighbors: Logarithmic complexity for fitness evaluation in genetic algorithms. In Proceedings of IEEE Congress on Evolutionary Computation, pages 1431–1438, 2021.
  39. J. Rowe and M. Vose. Unbiased black box search algorithms. In Proceedings of Genetic and Evolutionary Computation Conference, pages 2035–2042, 2011.
  40. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362–391, 1983.
  41. Self-adjusting binary search trees. Journal of ACM, 32(3):652–686, 1985.
  42. R. Storn and K. Price. Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341–359, 1997.
  43. A new generalized partition crossover for the traveling salesman problem: Tunneling between local optima. Evolutionary Computation, 28(2):255–288, 2020.
  44. NK hybrid genetic algorithm for clustering. IEEE Transactions on Evolutionary Computation, 22(5):748–761, 2018.
  45. An integer linear programming approach to the single and bi-objective Next Release problem. Information and Software Technology, 65:1–13, 2015.
  46. A. J. Walker. An efficient method for generating discrete random variables with general distributions. ACM Transactions on Mathematical Software, 3(3):253–256.
  47. A. J. Walker. New fast method for generating discrete random numbers with arbitrary frequency distributions. Electronics Letters, 10(8):127–128, 1974.
  48. Gray box optimization for Mk landscapes (NK landscapes and MAX-kSAT). Evolutionary Computation, 24(3):491–519, 2016.
  49. C. Wishon and J. R. Villalobos. Robust efficiency measures for linear knapsack problem variants. European Journal of Operational Research, 254(2):398–409, 2016.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now