Advertisement

Facilitating Evolutionary Algorithm Analysis with Persistent Data Structures

  • Erik PitzerEmail author
  • Michael Affenzeller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10671)

Abstract

Evolutionary algorithm analysis is often impeded by the large amounts of intermediate data that is usually discarded and has to be painstakingly reconstructed for real-world large-scale applications. In the recent past persistent data structures have been developed which offer extremely compact storage with acceptable runtime penalties. In this work two promising persistent data structures are explored in the context of evolutionary computation with the hope to open the door to simplified analysis of large-scale evolutionary algorithm runs.

Notes

Acknowledgements

The work described in this paper was performed within the COMET Project Heuristic Optimization in Production and Logistics (HOPL), #843532 funded by the Austrian Research Promotion Agency (FFG).

References

  1. 1.
    Asanovic, K., Bodik, R., Catanzaro, B.C., Gebis, J.J., Husbands, P., Keutzer, K., Patterson, D.A., Plishker, W.L., Shalf, J., Williams, S.W., Yelick, K.A.: The landscape of parallel computing research: a view from Berkeley. Electrical Engineering and Computer Sciences University of California at Berkeley, Technical report UCB/EECS-2006-183, December 2006Google Scholar
  2. 2.
    Bagwell, P.: Ideal hash trees. Technical report, École Polytechnique Fédéerale de Lausanne (2001)Google Scholar
  3. 3.
    Bagwell, P., Rompf, T.: RRB-Trees: efficient immutable vectors. Technical report, École Polytechnique Fédéerale de Lausanne (2011)Google Scholar
  4. 4.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  5. 5.
    Eyler, P.: The rise of functional languages. Linux J. (2007). https://www.linuxjournal.com/node/1000217
  6. 6.
    Warren Jr., H.S.: Hacker’s Delight, 2nd edn. Addison-Wesley, Reading (2013)Google Scholar
  7. 7.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  8. 8.
    McCarthy, J.: Lisp prehistory - summer 1956 through summer 1958 (1958). http://www-formal.stanford.edu/jmc/history/lisp/node2.html
  9. 9.
    McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, part I. Commun. ACM 3(4), 184–195 (1960)CrossRefzbMATHGoogle Scholar
  10. 10.
    Newell, A., Shaw, J.: Programming the logic theory machine. In: Proceedings of the Western Joint Computer Conference, pp. 230–240 (1957)Google Scholar
  11. 11.
    Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  12. 12.
    Rechenberg, I.: Evolutionsstrategie - Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart (1973)Google Scholar
  13. 13.
    Sutter, H.: The free lunch is over: a fundamental turn toward concurrency in software. Dr. Dobbs J. 30(3), 202–210 (2005)Google Scholar
  14. 14.
    Wagner, S., et al.: Architecture and design of the heuristiclab optimization environment. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z. (eds.) Advanced Methods and Applications in Computational Intelligence. Topics in Intelligent Engineering and Informatics, vol. 6, pp. 197–261. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-319-01436-4_10 CrossRefGoogle Scholar
  15. 15.
    Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: the genetic edge recombination operator. In: International Conference on Genetic Algorithms, pp. 133–140 (1989)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Department Software EngineeringUniversity of Applied Sciences Upper AustriaHagenbergAustria
  2. 2.Institute for Formal Models and VerificationJohannes Kepler UniversityLinzAustria

Personalised recommendations