Skip to main content

Mutual Information Analyses of Chaotic Neurodynamics Driven by Neuron Selection Methods in Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems

  • Conference paper
Neural Information Processing. Theory and Algorithms (ICONIP 2010)

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

Included in the following conference series:

Abstract

The exponentially decaying tabu search, which exhibits high performance in solving quadratic assignment problems (QAPs), has been implemented on a neural network with chaotic neurodynamics. To exploit the inherent parallel processing capability of analog hardware systems, a synchronous updating scheme, in which all neurons in the network are updated simultaneously, has also been proposed. However, several neurons may fire simultaneously with the synchronous updating. As a result, we cannot determine only one candidate for the 2-opt exchange from among the many fired neurons. To solve this problem, several neuron selection methods, which select a specific neuron from among the fired neurons, have been devised. These neuron selection methods improved the performance of the synchronous updating scheme; however, the dynamics of the chaotic neural network driven by these heuristic algorithms cannot be intuitively understood. In this paper, we analyze the dynamics of a chaotic neural network driven by the neuron selection methods by considering the spatial and temporal mutual information.

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

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. Taillard, E.: Robust tabu search for the quadratic assignment problems. Parallel Computing 17, 443–455 (1991)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  5. Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - A quadratic assignment problem library, http://www.opt.math.tu-graz.ac.at/qaplib/

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Yokota, N., Horio, Y., Aihara, K.: A synchronous exponential chaotic tabu search for quadratic assignment problems. In: Proc. Int. Workshop on Nonlinear Circuit and Signal Processing, CD-ROM ( March 2008)

    Google Scholar 

  8. Yokota, N., Horio, Y., Aihara, K.: A modified synchronous exponential chaotic tabu search for quadratic assignment problems. IEICE Technical Report NLP107(561), 49–54 (2008) (in Japanese)

    Google Scholar 

  9. Kawamura, T., Horio, Y.: Evaluation of neuron selection techniques for synchronous exponential chaotic tabu search for quadratic assignment problems. IEICE Technical Report NLP109(269), 67–71 (2009) (in Japanese)

    Google Scholar 

  10. Hillier, F., Michael, M.: Quadratic assignment problem algorithms and the location of indivisible facilities. Management Science, Series A, Sciences 13(1), 42–57 (September 1966)

    Article  Google Scholar 

  11. Shirakuma, A., Horio, Y., Aihara, K.: An improved neuron selection technique in an exponential chaotic tabu search hardware system for large-scale quadratic assignment problems. In: Proc. Int. Workshop on Nonlinear Circuit and Signal Processing, CD-ROM (March 2009)

    Google Scholar 

  12. Masanao, O., Yuba, K.: Associative memory and amount of mutual information in a chaotic neural network introducing function typed synaptic weights. In: Proc. of the 9th Int. Conf. on Neural Info. Processing, vol. 4, pp. 1617–1622 (November 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kawamura, T., Horio, Y., Hasegawa, M. (2010). Mutual Information Analyses of Chaotic Neurodynamics Driven by Neuron Selection Methods in Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds) Neural Information Processing. Theory and Algorithms. ICONIP 2010. Lecture Notes in Computer Science, vol 6443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17537-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17537-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17536-7

  • Online ISBN: 978-3-642-17537-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics