Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Optical Supercomputing

OSC 2009: Optical SuperComputing pp 56–69Cite as

Evolutionary Design of Graph-Based Structures for Optical Computing

  • Conference paper

  • 665 Accesses

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

Abstract

Designing optical devices for solving NP-complete problems is a difficult task. The difficulty consists in constructing a graph which - when traversed by light - generates all possible solutions of the problem to be solved. So far only few devices of this type have been proposed. Here we suggest the use of evolutionary algorithms for solving this problem: the graphs are generated using a special Genetic Programming approach. We have tested our idea on the subset sum problem. Numerical experiments shows the effectiveness of the proposed approach.

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

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aaronson, S.: NP-complete problems and physical reality. ACM SIGACT News Complexity Theory Column, March. ECCC TR05-026, quant-ph/0502072 (2005)

    Google Scholar 

  2. Banzhaf, W., Nordin, P., Keller, E.R., Francone, F.D.: Genetic Programming - An Introduction. Morgan Kaufmann, San Francisco (1998)

    MATH  Google Scholar 

  3. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)

    Google Scholar 

  4. Brameier, M., Banzhaf, W.: A Comparison of Linear Genetic Programming and Neural Networks in Medical Data Mining. IEEE Transactions on Evolutionary Computation 5, 17–26 (2001)

    Article  Google Scholar 

  5. Dolev, S., Nir, Y.: Optical Implementation of Bounded non Deterministic Turing Machine, Patent Filed May 2003 in Israel, May 2004 USA (2004)

    Google Scholar 

  6. Dolev, S., Fitoussi, H.: The Traveling Beams, Optical Solutions for Bounded NP-Complete Problems. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 120–134. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to NP-Completeness. Freeman & Co., San Francisco (1979)

    MATH  Google Scholar 

  8. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  9. Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem. Opt. Express 15, 10473–10482 (2007)

    Article  Google Scholar 

  10. Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem:erratum. Opt. Express 15, 12627–12627 (2007)

    Article  Google Scholar 

  11. Haist, T., Osten, W.: Ultra-fast digital optical arithmetic using waveoptical computing. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 33–45. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Koza, J.R.: Genetic Programming: on the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  13. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Subprograms. MIT Press, Cambridge (1994)

    Google Scholar 

  14. Koza, J.R., et al.: Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann, San Francisco (1999)

    MATH  Google Scholar 

  15. Miller, J.F., Thomson, P.: Cartesian Genetic Programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)

    Google Scholar 

  16. Muntean, O.: Optical Solutions for NP-complete problems, graduation thesis, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania, defended July 3 (2007)

    Google Scholar 

  17. Muntean, O., Oltean, M.: Using light for solving the unbounded subset-sum problem. International Journal of Innovative Computing, Information and Control 5(8), 2159–2167 (2009)

    Google Scholar 

  18. Muntean, O., Oltean, M.: Deciding whether a linear Diophantine equation has solutions by using a light-based device (submitted) (2008)

    Google Scholar 

  19. Nordin, P.: A Compiling Genetic Programming System that Directly Manipulates the Machine Code. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, pp. 311–331. MIT Press, Cambridge (1994)

    Google Scholar 

  20. Oltean, M., Groşan, C.: Evolving evolutionary algorithms using multi expression programming. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS (LNAI), vol. 2801, pp. 651–658. Springer, Heidelberg (2003)

    Google Scholar 

  21. Oltean, M.: A light-based device for solving the Hamiltonian path problem. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol. 4135, pp. 217–227. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Oltean, M.: Solving the Hamiltonian path problem with a light-based computer. Natural Computing 7(1), 57–70 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  23. Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing 8(2), 321–331 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  24. Oltean, M., Muntean, O.: Exact Cover with light. New Generation Computing 26(4), 329–346 (2008)

    Article  MATH  Google Scholar 

  25. Oltean, M., Muntean, O.: Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 115–127. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  26. Oltean, M., Grosan, C., Diosan, L., Mihaila, C.: Genetic Programming with linear representation: a survey. International Journal on Artificial Intelligence Tools 19(2), 197–238 (2009)

    Article  Google Scholar 

  27. Poli, R., Langdon, W.B.: Sub-machine Code Genetic Programming. In: Spector, L., Langdon, W.B., O’Reilly, U.-M., Angeline, P.J. (eds.) Advances in Genetic Programming 3, ch. 13. MIT Press, Cambridge (1999)

    Google Scholar 

  28. Poli, R., Page, J.: Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes. Journal of Genetic Programming and Evolvable Machines, 1–21 (2000)

    Google Scholar 

  29. Syswerda, G.: Uniform Crossover in Genetic Algorithms. In: Schaffer, J.D. (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, MKP, CA, pp. 2–9 (1989)

    Google Scholar 

  30. Wolpert, D.H., McReady, W.G.: No Free Lunch Theorems for Optimisation. IEEE Transaction on Evolutionary Computation 1, 67–82 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Kogălniceanu 1, Cluj-Napoca, 400084, Romania

    Mihai Oltean & Oana Muntean

Authors
  1. Mihai Oltean
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oana Muntean
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben Gurion University of the Negev, Beer-Sheva, Israel

    Shlomi Dolev

  2. Department of Computer Science, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Cluj-Napoca, Romania

    Mihai Oltean

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oltean, M., Muntean, O. (2009). Evolutionary Design of Graph-Based Structures for Optical Computing. In: Dolev, S., Oltean, M. (eds) Optical SuperComputing. OSC 2009. Lecture Notes in Computer Science, vol 5882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10442-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10442-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10441-1

  • Online ISBN: 978-3-642-10442-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation