Skip to main content

Improving Efficiency of Metaheuristics for Cellular Automaton Inverse Problem

  • Conference paper
  • First Online:
Artificial Evolution (EA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8752))

  • 634 Accesses

Abstract

The aim of this paper concerns several propositions to improve previous works based on a combination between metaheuristic and cellular automaton for the generation of 2D shapes. These improvements concern both the reduction of the search space and of the computational time. The first proposition concerns a new approach which delegates the determination of the number of generation to the cellular automaton. The second proposition consists in the reduction of the number of times the cellular automaton is requested. The last proposition concerns the adaptation of the method by exploiting the properties of the expected shape, in particular in case of symmetric shapes. Obtained results show that these propositions permit to improve the results as well as the computational times and the quality of the solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kenneth, O., Stanly, K., Miikkulainen, R.: A Taxonomy for Artificial Embryogeny. Artif. Life J. 9(2), 93–130 (2003)

    Article  Google Scholar 

  2. De Garis, H.D.: Artificial embryology and cellular differentiation. In: Bentley, P.J. (ed.) Evolutionary Design by Computers. Morgan Kaufmann Publishers, San Francisco (1999)

    Google Scholar 

  3. Wolfram, S.: Universality and complexity in cellular automata. Physica D10, 1–35 (1984). North Holland

    MathSciNet  Google Scholar 

  4. Moreira, J., Deutsch, A.: Cellular automaton models of tumor development: a critical review. Adv. Complex Syst. 5, 247–267 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Karalyllidis, I.: Acceleration of cellular automata algorithms using genetic algorithms. Adv. Eng. Softw. 30, 419–437 (1999)

    Article  Google Scholar 

  6. Margolus, N.: Physics-like models of computation. Physica 10 D, 81–95 (1984)

    MathSciNet  Google Scholar 

  7. Chavoya, A., Duthen, Y.: Using a genetic algorithm to evolve cellular automata for 2D/3D computational development. In: 8th Annual Conference on Genetic and Evolutionary Computation, USA (2006)

    Google Scholar 

  8. Ganguly, N., Sikdar, K.B., Deutsch, A., Canright, G., Chaudhuri, P.: A survey on cellular automata. Technical Report, Centre for High Performance Computing, Dresden University of Technology, December 2003

    Google Scholar 

  9. Mitchell, M., Crutchfield, J.P., Das, R.: Evolving cellular automata with genetic algorithms: a review of recent work. In: 1st International Conference on Evolutionary Computation and its Applications, Russia (1996)

    Google Scholar 

  10. Bäck, T., Breukelaar, R.: Using genetic algorithms to evolve behavior in cellular automata. In: Calude, C.S., Dinneen, M.J., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 1–10. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Gray, R.: Entropy and Information Theory. Springer, New York (1990)

    Book  MATH  Google Scholar 

  12. Mainzer, K.: Symmetry and complexity in dynamical systems. Eur. Rev. 13(2), 29–48 (2005)

    Article  Google Scholar 

  13. Sapin, E., Bailleux, O., Jean-Jacques, C.: Research of a cellular automaton simulating logic gates by evolutionary algorithms. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 414–423. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Aiboud, F., Grangeon, N., Norre, S.: Simulated annealing based metaheuristics and binary cellular automata to generate 2D shapes. In: 10th International Conference on Aritificial Evolution, Angers (2011)

    Google Scholar 

  15. Aiboud, F., Grangeon, N., Norre, S.: Generation of 2D shapes with cellular automaton and genetic algorithm: extension of Chavoya and Duthen work. In: 9th Metaheuristics International Conference MIC, Italy (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fazia Aboud .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Aboud, F., Grangeon, N., Norre, S. (2014). Improving Efficiency of Metaheuristics for Cellular Automaton Inverse Problem. In: Legrand, P., Corsini, MM., Hao, JK., Monmarché, N., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2013. Lecture Notes in Computer Science(), vol 8752. Springer, Cham. https://doi.org/10.1007/978-3-319-11683-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11683-9_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11682-2

  • Online ISBN: 978-3-319-11683-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics