Skip to main content
SpringerLink
Log in

Theory and Applications of Chaotic Optimization Methods

  • Chapter
Innovative Computing Methods and Their Applications to Engineering Problems

Part of the book series: Studies in Computational Intelligence ((SCI,volume 357))

Introduction

In our society, various combinatorial optimization problems exist and we must often solve them, for e.g. scheduling, delivery planning, circuit design, and computer wiring. Then, one of the important issues in science and engineering is how to develop effective algorithms for solving these combinatorial problems.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hopfield, J.J., Tank, D.W.: ‘Neural’ computation of decisions in optimization problems. Biol. Cybern. 52, 141–152 (1985)

    MATH  MathSciNet  Google Scholar 

  2. Hayakawa, Y., Marumoto, A., Sawada, Y.: Effects of the chaotic noise on the performance of a neural network model for optimization problems. Phys. Rev. E 51, 2693–2696 (1995)

    Article  Google Scholar 

  3. Hasegawa, M., Ikeguchi, T., Matozaki, T., Aihara, K.: An analysis of additive effects of nonlinear dynamics for combinatorial optimization. IEICE Trans. Fundamentals E80-A(1), 206–213 (1997)

    Google Scholar 

  4. Hasegawa, M., Umeno, K.: Solvable performances of optimization neural networks with chaotic noise and stochastic noise with negative autocorrelation. In: Ishikawa, M., Doya, K., Miyamoto, H., Yamakawa, T. (eds.) ICONIP 2007, Part I. LNCS, vol. 4984, pp. 693–702. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Uwate, Y., Nishio, Y., Ueta, T., Kawabe, T., Ikeguchi, T.: Performance of chaos and burst noises injected to the hopfield nn for quadratic assignment problems. IEICE Trans. Fundamentals E87-A(4), 937–943 (2004)

    Google Scholar 

  6. Minami, Y., Hasegawa, M.: Analysis of relationship between solvable performance and cross-correlation on optimization by neural network with chaotic noise. Journal of Signal Processing 13(4), 299 (2009)

    Google Scholar 

  7. Nozawa, H.: A neural network model as a globally coupled map and applications based on chaos. Chaos 2(3), 884–891 (1992)

    Article  MathSciNet  Google Scholar 

  8. Chen, L., Aihara, K.: Chaotic simulated annealing by a neural network model with transient chaos. Neural Networks 8(6), 915–930 (1995)

    Article  Google Scholar 

  9. Yamada, T., Aihara, K.: Nonlinear neurodynamics and combinatorial optimization in chaotic neural networks. Journal of Intelligent and Fuzzy Systems 5, 53–68 (1997)

    Google Scholar 

  10. Hasegawa, M., Ikeguchi, T., Motozaki, T., Aihara, K.: Solving combinatorial optimization problems by nonlinear neural dynamics. In: Proc. of IEEE International Conference on Neural Networks, pp. 3140–3145 (1995)

    Google Scholar 

  11. Wang, L., Li, S., Tian, F., Fu, X.: A noisy chaotic neural network for solving combinatorial optimization problems: Stochastic chaotic simulated annealing. IEEE Trans. on Systems, MAN, and Cybernetics - Part B: Cybernetics 34(5), 2119–2125 (2004)

    Article  Google Scholar 

  12. Wang, L.P., Li, S., Tian, F.Y., Fu, X.J.: Noisy chaotic neural networks with variable thresholds for the frequency assignment problem in satellite communications. IEEE Trans. on Systems, MAN, and Cybernetics - Part C: Applications and Reviews 38(2), 209–217 (2008)

    Article  MATH  Google Scholar 

  13. Wang, L., Liu, W., Shi, H.: Delay-constrained multicast routing using the noisy chaotic neural network. IEEE Trans. on Computers 58(1), 82–89 (2009)

    Article  MathSciNet  Google Scholar 

  14. Hasegawa, M., Ikeguchi, T., Aihara, K.: Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Phys. Rev. Lett. 79(12), 2344–2347 (1997)

    Article  Google Scholar 

  15. Hasegawa, M., Ikeguchi, T., Aihara, K.: Solving large scale traveling salesman problems by chaotic neurodynamics. Neural Networks 15(2), 271–283 (2002)

    Article  Google Scholar 

  16. Hasegawa, M., Ikeguchi, T., Aihara, K.: Tabu search for the traveling salesman problem and its extension to chaotic neurodynamical search. Proceedings of International Symposium of Artificial Life and Robotics 1, 120–123 (2002)

    Google Scholar 

  17. Motohashi, S., Matsuura, T., Ikeguchi, T., Aihara, K.: The lin-kernighan algorithm driven by chaotic neurodynamics for large scale traveling salesman problems. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009. LNCS, vol. 5769, pp. 563–572. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Matsuura, T., Ikeguchi, T.: Chaotic search for traveling salesman problems by using 2-opt and or-opt algorithms. In: Kůrková, V., Neruda, R., Koutník, J. (eds.) ICANN 2008, Part II. LNCS, vol. 5164, pp. 587–596. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D thesis. Department of Industrial Engineering and Management Science, Northwestern University, Evanston, Illinois (1967)

    Google Scholar 

  20. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 498–516 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  21. Glover, F.: New ejection chain and alternating path methods for traveling salesman problems. Computer Science and Operations Research, 449–509 (1992)

    Google Scholar 

  22. Rego, C.: Relaxed tours and path ejections for the traveling salesman problem. European Journal of Operational Research 106, 522–538 (1998)

    Article  MATH  Google Scholar 

  23. Aihara, K.: Chaotic neural networks. In: Kawakami, H. (ed.) Bifurcation Phenomena in Nonlinear System and Theory of Dynamical Systems, pp. 143–161. World Scientific, Singapore (1990)

    Google Scholar 

  24. Aihara, K., Takabe, T., Toyoda, M.: Chaotic neural networks. Phys. Lett. A 144, 333–340 (1990)

    Article  MathSciNet  Google Scholar 

  25. Glover, F.: Tabu search–part I. ORSA Journal on Computing 1, 190–206 (1989)

    MATH  MathSciNet  Google Scholar 

  26. Glover, F.: Tabu search–part II. ORSA Journal on Computing 2, 4–32 (1990)

    MATH  Google Scholar 

  27. Matsuura, T., Ikeguchi, T.: An effective chaotic search by using 2-opt and Or-opt algorithms for traveling salesman problem. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, vol. 21, pp. 77–80 (2008)

    Google Scholar 

  28. Matsuura, T., Ikeguchi, T.: A new chaotic algorithm for solving traveling salesman problems by using 2-opt and Or-opt algorithms. Technical Report of IEICE 107(561), 37–42 (2008)

    Google Scholar 

  29. Motohashi, S., Matsuura, T., Ikeguchi, T.: Chaotic search method using the Lin-Kernighan algorithm for traveling salesman problems. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 144–147 (2008)

    Google Scholar 

  30. Motohashi, S., Matsuura, T., Ikeguchi, T.: The extended chaotic search method using the Lin-Kernighan algorithm. In: Proceedings of IEICE Society Conference, vol. A-2-5, p. 32 (2008)

    Google Scholar 

  31. Motohashi, S., Matsuura, T., Ikeguchi, T.: Parameter tuning method of chaotic search method for solving traveling salesman problems. In: Proceedings of IEICE General Conference, vol. A-2-14 (2009)

    Google Scholar 

  32. Motohashi, S., Matsuura, T., Ikeguchi, T.: Chaotic search based on the ejection chain method for traveling salesman problems. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 304–307 (2009)

    Google Scholar 

  33. Kantz, H., Schreiber, T.: Nonlinear time series analysis. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  34. Mazzini, G., Rovatti, R., Setti, G.: Interference minimization by autocorrelation shaping in asynchronous DS-CDMA systems: chaos-based spreading is nearly optimal. Electronics Letters 14, 1054 (1999)

    Article  Google Scholar 

  35. Umeno, K., Yamaguchi, A.: Construction of optimal chaotic spreading sequence using lebesgue spectrum filter. IEICE Trans. Fundamentals 4, 849–852 (2002)

    Google Scholar 

  36. Aihara, K.: Chaos engineering and its application to parallel distributed processing with chaotic neural networks. Proc. of the IEEE 90(5), 919–930 (2002)

    Article  MathSciNet  Google Scholar 

  37. Adachi, M., Aihara, K.: Associative dynamics in a chaotic neural network. Neural Networks 10(1), 83–98 (1997)

    Article  Google Scholar 

  38. Hasegawa, M.: Chaotic neurodynamical approach for combinatorial optimization. Doctor’s thesis, Tokyo University of Science (2000)

    Google Scholar 

  39. Hasegawa, M., Ikeguchi, T., Aihara, K.: A novel approach for solving large scale traveling salesman problems by chaotic neural networks. In: Proc. of International Symposium on Nonlinear Theory and its Applications, pp. 711–714 (1998)

    Google Scholar 

  40. Hasegawa, M., Ikeguchi, T., Aihara, K.: Harnessing of chaotic dynamics for solving combinatorial optimization problems. In: Proc. of International Conference on Neural Information Processing, pp. 749–752 (1998)

    Google Scholar 

  41. Hasegawa, M., Ikeguchi, T., Aihara, K.: Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems. Control and Cybernetics 29(3), 773–788 (2000)

    MATH  MathSciNet  Google Scholar 

  42. Hasegawa, M., Ikeguchi, T., Aihara, K., Itoh, K.: A novel chaotic search for quadratic assignment problems. European J. of Operational Research 139, 543–556 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  43. Hoshino, T., Kimura, T., Ikeguchi, T.: Two simple local searches controlled by chaotic dynamics for vehicle routing problems with time windows. In: Proc. Metaheuristics Int. Conf., CD–ROM, Montreal, Canada, June 25-29 (2007)

    Google Scholar 

  44. Hoshino, T., Kimura, T., Ikeguchi, T.: A metaheuristic algorithm for solving vehicle rouging problems with soft time windows by chaotic neurodynamics. Transactions of IEICE J90-A(5), 431–441 (2007)

    Google Scholar 

  45. Hoshino, T., Kimura, T., Ikeguchi, T.: A new diversification method to solve vehicle routing problems using chaotic dynamics. In: Complexity, Applications of Nonlinear Dynamics, pp. 409–412. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  46. Matsuura, T., Ikeguchi, T.: A chaotic search for extracting motifs from DNA sequences. In: Proceedings of 2005 RISP International Workshop on Nonlinear Circuits and Signal Processing, pp. 143–146 (March 2005)

    Google Scholar 

  47. Matsuura, T., Ikeguchi, T., Horio, Y.: Tabu search and chaotic search for extracting motifs from DNA sequences. In: Proceedings of the 6th Metaheuristics International Conference, pp. 677–682 (August 2005)

    Google Scholar 

  48. Matsuura, T., Ikeguchi, T.: Refractory effects of chaotic neurodynamics for finding motifs from DNA sequences. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 1103–1110. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  49. Matsuura, T., Ikeguchi, T.: Statistical analysis of output spike time-series from chaotic motif sampler. In: Ishikawa, M., Doya, K., Miyamoto, H., Yamakawa, T. (eds.) ICONIP 2007, Part I. LNCS, vol. 4984, pp. 673–682. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  50. Kimura, T., Nakajima, H., Ikeguchi, T.: A packet routing method for a random network by a stochastic neural network. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 122–125 (2005)

    Google Scholar 

  51. Kimura, T., Ikeguchi, T.: A packet routing method using chaotic neurodynamics for complex networks. In: Kollias, S.D., Stafylopatis, A., Duch, W., Oja, E. (eds.) ICANN 2006. LNCS, vol. 4132, pp. 1012–1021. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  52. Kimura, T., Ikeguchi, T.: Chaotic dynamics for avoiding congestion in the computer network. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 363–370. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  53. Kimura, T., Ikeguchi, T.: Optimization for packet routing using a chaotic neurodynamics. In: Proceedings of IEEE International Symposium on Circuits and Systems (2006)

    Google Scholar 

  54. Kimura, T., Ikeguchi, T.: A new algorithm for packet routing problems using chaotic neurodynamics and its surrogate analysis. Neural Computation and Applications 16, 519–526 (2007)

    Article  Google Scholar 

  55. Kimura, T., Nakajima, H., Ikeguchi, T.: A packet routing method for complex networks by a stochastic neural network. Physica A 376, 658–672 (2007)

    Article  Google Scholar 

  56. Kimura, T., Ikeguchi, T.: An efficient routing strategy with load-balancing for complex networks. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 31–34 (2007)

    Google Scholar 

  57. Kimura, T., Ikeguchi, T.: An optimum strategy for dynamic and stochastic packet routing problems by chaotic neurodynamics. Integrated Computer-Aided Engineering 14(4), 307–322 (2007)

    Google Scholar 

  58. Kimura, T., Ikeguchi, T.: Chaotic routing on complex networks. IEICE Technical Report, pp. 25–30 (2007)

    Google Scholar 

  59. Kirkpatrick Jr., S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  60. Rego, C.: Relaxed tours and path ejections for the traveling salesman problem. European Journal of Operational Research 106, 522–538 (1998)

    Article  MATH  Google Scholar 

  61. TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

  62. Taillard, E., Guertin, F., Badeau, P., Gendreau, M., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31, 170–186 (1997)

    Article  MATH  Google Scholar 

  63. Bräysy, O., Gendreau, M.: Tabu search heuristics for the vehicle routing problem with time windows. Internal Report STF42 A01022 (2001)

    Google Scholar 

  64. Hoshino, T., Kimura, T., Ikeguchi, T.: Solving vehicle routing problems with soft time windows using chaotic neurodynamics. Tech. Rep. IEICE 105(675), 17–22 (2007)

    Google Scholar 

  65. Solomon’s benchmark problems, http://web.cba.neu.edu/~msolomon/problems.htm .

  66. Gehring and Homberger benchmark problems, http://www.sintef.no/static/am/opti/projects/top/vrp/benchmarks.html .

  67. Bräysy, O.: A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS Journal on Computing 15(4), 347–368 (2003)

    Article  MathSciNet  Google Scholar 

  68. Matsuura, T., Anzai, T., Ikeguchi, T., Horio, Y., Hasegawa, M., Ichinose, N.: A tabu search for extracting motifs from DNA sequences. In: Proceedings of 2004 RISP International Workshop on Nonlinear Circuits and Signal Processing, pp. 347–350 (March 2004)

    Google Scholar 

  69. Matsuura, T., Ikeguchi, T.: Analysis on memory effect of chaotic dynamics for combinatorial optimization problem. In: Proceedings of the 6th Metaheuristics International Conference (2007)

    Google Scholar 

  70. Matsuura, T., Ikeguchi, T.: Chaotic motif sampler: Discovering motifs from biological sequences by using chaotic neurodynamics. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 368–371 (2009)

    Google Scholar 

  71. Hernandez, D., Gras, R., Appel, R.: Neighborhood functions and hill-claiming strategies dedicated to the generalized ungapped local multiple alignment. European Journal of Operational Research 185, 1276–1284 (2005)

    Article  MathSciNet  Google Scholar 

  72. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwqld, A.F., Wootton, J.C.: Detecting subtle sequence signals: A gibbs sampling strategy for multiple alignment. Science 262, 208–214 (1993)

    Article  Google Scholar 

  73. Bellman, E.: On a routing problem. Quarterly of Applied Mathematics 16, 87–90 (1958)

    MATH  MathSciNet  Google Scholar 

  74. Dreyfus, S.: An appraisal of some shortest path algorithms. Operations Research 17, 395–412 (1969)

    Article  MATH  Google Scholar 

  75. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerical Mathematics 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  76. Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research, 499–516 (1998)

    Google Scholar 

  77. Davies, C., Lingras, P.: Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. European Journal of Operational Research 144, 27–38 (2003)

    MATH  MathSciNet  Google Scholar 

  78. Horiguchi, T., Ishioka, S.: Routing control of packet flow using a neural network. Physica A 297, 521–531 (2001)

    Article  MATH  Google Scholar 

  79. Kimura, T., Nakajima, H.: A packet routing method using a neural network with stochastic effects. IEICE Technical Report 104(112), 5–10 (2004)

    Google Scholar 

  80. Horiguchi, T., Hayashi, K., Tretiakov, A.: Reinforcement learning for congestion-avoidance in packet flow. Physica A 349, 329–348 (2005)

    Article  Google Scholar 

  81. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  82. Faloutsos, M., Faloutsos, F., Faloutsos, C.: On power-law relationships of the internet topology. In: Proc. of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 251–262 (1999)

    Google Scholar 

  83. Echenique, P., Gomez-Gardens, J., Moreno, Y.: Improved routing strategies for internet traffic delivery. Physical Review E 70(056105), 325–331 (2004)

    Google Scholar 

  84. Echenique, P., Gomez-Gardens, J., Moreno, Y.: Dynamics of jamming transitions in complex networks. Europhysics Letters 71(2), 325–331 (2005)

    Article  Google Scholar 

  85. Horio, Y., Aihara, K.: A large-scale chaotic neuro-computer. In: Proc. Joint Symp. for Advanced Science and Technology, Hatoyama, Japan, December 20, pp. 583–586 (1990)

    Google Scholar 

  86. Horio, Y., Suyama, K.: Switched-capacitor chaotic neuron for chaotic neural networks. In: Proc. IEEE Int. Symp. on Circuits and Syst., Chicago, IL, May 3-6, vol. 2, pp. 1018–1021 (1993)

    Google Scholar 

  87. Horio, Y., Suyama, K.: IC implementation of switched-capacitor chaotic neuron for chaotic neural networks. In: Proc. IEEE Int. Symp. on Circuits and Syst., London, UK, May 30-June 2, vol. 6, pp. 97–100 (1994)

    Google Scholar 

  88. Horio, Y., Suyama, K., Dec, A., Aihara, K.: Switched-capacitor chaotic neural networks for traveling salesman problem. In: Proc. INNS World Congress on Neural Networks, San Diego, CA, June 5-9, vol. 4, pp. 690–696 (1994)

    Google Scholar 

  89. Horio, Y., Suyama, K.: IC implementation of chaotic neuron and its application to synchronization of chaos. In: Proc. Int. Symp. on Nonlinear Theory and Its Applications, Ibusuki, October 6-8, pp. 185–188 (1994)

    Google Scholar 

  90. Horio, Y., Suyama, K.: Experimental observations of 2- and 3-neuron chaotic neural networks using switched-capacitor chaotic neuron IC chip. IEICE Trans. Fundamentals E78-A(4), 529–535 (1995)

    Google Scholar 

  91. Horio, Y., Suyama, K.: Dynamical associative memory using integrated switched-capacitor chaotic neurons. In: Proc. IEEE Int. Symp. on Circuits and Syst., Seattle, WA, April 30-May 2, pp. 429–435 (1995)

    Google Scholar 

  92. Horio, Y., Suyama, K.: Experimental verification of signal transmission using synchronized sc chaotic neural networks. IEEE Trans. Circuits Syst. I 42(7), 393–395 (1995)

    Article  Google Scholar 

  93. Horio, Y., Kobayashi, I., Kawakami, M., Hayashi, H., Aihara, K.: Switched-capacitor multi-internal-state chaotic neuron circuit with unipolar and bipolar output functions. In: Proc. Int. Conf. on Microelectronics for Neural, Fuzzy, and Bio-Inspired Systems, Granada, Spain, April 7-9, pp. 267–274 (1999)

    Google Scholar 

  94. Horio, Y., Kobayashi, I., Kawakami, M., Hayashi, H., Aihara, K.: Switched-capacitor multi-internal-state chaotic neuron circuit with unipolar and bipolar output functions. In: Proc. IEEE Int. Symp. on Circuits and Syst., Orlando, FL, May 30-June 2, pp. 438–441 (1999)

    Google Scholar 

  95. Horio, Y., Aihara, K.: Chaotic neuro-computer. In: Chen, G., Ueta, T. (eds.) Chaos in Circuits and Systems, pp. 237–255. World Scientific, Singapore (2002)

    Chapter  Google Scholar 

  96. Horio, Y., Aihara, K., Yamamoto, O.: Neuron-synapse IC chip-set for large-scale chaotic neural networks. IEEE Trans. Neural Networks 14(5), 1393–1404 (2003)

    Article  Google Scholar 

  97. Horio, Y., Okuno, T., Mori, K.: Mixed analog/digital chaotic neuro-computer prototype: 400-neuron dynamical associative memory. In: Proc. of Int. Joint Conf. on Neural Networks, Budapest, Hungary, July 25-29, vol. 3, pp. 1717–1722 (2004)

    Google Scholar 

  98. Horio, Y., Okuno, T., Mori, K.: Switched-capacitor large-scale chaotic neuro-computer prototype and chaotic search dynamics. In: Proc. Int. Conf. on Knowledge-Based Intelligent Information and Engineering Systems, Wellington, New Zealand, September 20-24, vol. 1, pp. 988–994 (2004)

    Google Scholar 

  99. Horio, Y.: Analog computation with physical chaotic dynamics. In: Proc. RISP Int. Workshop on Nonlinear Circuit and Signal Processing, Hawaii, U.S.A., March 4-6, pp. 255–258 (2005)

    Google Scholar 

  100. Horio, Y., Ikeguchi, T., Aihara, K.: A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems. INNS Neural Networks 18(5-6), 505–513 (2005)

    Article  Google Scholar 

  101. Horio, Y., Aihara, K.: Physical chaotic neuro-dynamics and optimization. In: Proc. Int. Symp. on Nonlinear Theory and Its Applications, Bologna, Italy, September 11-14, pp. 449–502 (2006)

    Google Scholar 

  102. Horio, Y., Aihara, K.: Real-number computation through high-dimensional analog physical chaotic neuro-dynamics. In: Proc. Unconventional Computation: Quo Vadis?, Santa Fe, U.S.A., March 21-23 (2007)

    Google Scholar 

  103. Horio, Y., Aihara, K.: Analog computation through high-dimensional physical chaotic neuro-dynamics. Physica-D 237(9), 1215–1225 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Sciences, Saitama University, 255 Shimo-ohkubo, Sakura-ku, Saimata, 338-8570, Japan

    Tohru Ikeguchi

  2. Department of Electrical Engineering, Faculty of Engineering, Tokyo Univesity of Science, 1-14-6 Kudankita, Chiyoda-ku, Tokyo, 102-0073, Japan

    Mikio Hasegawa

  3. Department of Electrical and Electronic Engineering, Faculty of Engineering, Nagasaki University, 1-14 Bunkyo-machi, Nagasaki, 852-8521, Japan

    Takayuki Kimura

  4. Department of Management Science, Faculty of Engineering, Tokyo Univesity of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo, 162-8601, Japan

    Takafumi Matsuura

  5. Institute of Industrial Science, University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo, 153-8505, Japan

    Kazuyuki Aihara

Authors
  1. Tohru Ikeguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikio Hasegawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takayuki Kimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Takafumi Matsuura
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kazuyuki Aihara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronics Engineering and Telecommunications Faculty of Engineering, State University of Rio de Janeiro, Brazil

    Nadia Nedjah

  2. Católica do Paraná Centro de Ciências, Pontifícia Universidade, Rua Imaculada Conceição 1155, 80215-901, Curitiba, Brazil

    Leandro dos Santos Coelho

  3. Mechanical Engineering Graduate Program, Pontifical Catholic University of Parana, Imaculada Conceição, 1155, 80215-901, Curitiba, Brazil

    Viviana Cocco Mariani

  4. Faculdade de Engenharia, Universidade do Estado do Rio de Janeiro, Rua São Francisco Xavier 524 Sala 5022, 20559-900, Rio de Janeiro, Brazil

    Luiza de Macedo Mourelle

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ikeguchi, T., Hasegawa, M., Kimura, T., Matsuura, T., Aihara, K. (2011). Theory and Applications of Chaotic Optimization Methods. In: Nedjah, N., dos Santos Coelho, L., Mariani, V.C., de Macedo Mourelle, L. (eds) Innovative Computing Methods and Their Applications to Engineering Problems. Studies in Computational Intelligence, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20958-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20958-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20957-4

  • Online ISBN: 978-3-642-20958-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation