Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Markovian neural networks

Abstract

The neural network that efficiently and nearly optimally solves difficult optimization problems is defined. The convergence proof for the Markovian neural network that asynchronously updates its neurons' states is also presented. The comparison of the performance of the Markovian neural network with various combinatorial optimization methods in two domains is described. The Markovian neural network is shown to be an efficient tool for solving optimization problems.

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

References

  1. Angéniol B, de La Croix G, Le Texier J (1988) Self-organizing feature maps and travelling salesman problem. Neural Networks 1:289–293

  2. Bonomi E, Lutton J (1984) The N-city travelling salesman problem: statistical mechanics and the metropolis algorithm. SIAM Rew 26:551–568

  3. Coffman EG, Denning PJ (1973) Operating system theory. Prentice-Hall, Englewood Cliffs

  4. Fogel DB (1988) An evolutionary approach to the travelling salesman problem. Biol Cybern 60:139–144

  5. Fort JC (1988) Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the travelling salesman problem. Biol Cybern 59:33–40

  6. Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York

  7. Hopfield JJ, Tank DW (1985) “Neural” computation of decisions in optimization problems. Biol Cybern 5:141–152

  8. Lin S (1965) Computer solutions for the travelling salesman problem. Bell Syst Tech J 44:2245–2269

  9. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the travelling salesman problem. Oper Res 21:498–516

  10. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

  11. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller W (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092

  12. Takács L (1960) Stochastic processes. Wiley, New York

  13. Wilson GV, Pawley GS (1988) On the stability of the travelling salesman problem algorithm of Hopfield and Tank. Biol Cybern 58:63–70

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kovačič, M. Markovian neural networks. Biol. Cybern. 64, 337–342 (1991). https://doi.org/10.1007/BF00199598

Download citation

Keywords

  • Neural Network
  • Combinatorial Optimization
  • Efficient Tool
  • Solve Optimization Problem
  • Convergence Proof