Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks

Volumn 8, Issue 6, 1995, Pages 915-930

  Chen, Luonan ^a   Aihara, Kazuyuki ^b  

^a Power System Department The Kaihatsu Computing Service Centre Ltd ^*  (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Bifurcation; Chaos; Combinatorial optimization problem; Modem heuristic; Neural network; NP hard; Simulated annealing; Transient chaos; TSP

Indexed keywords

ALGORITHMS; BIFURCATION (MATHEMATICS); CHAOS THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; POLYNOMIALS; SCHEDULING; SIMULATED ANNEALING;

BIFURCATION PARAMETER; HOPFIELD NEURAL NETWORKS; NEURAL NETWORK MODEL; NEURODYNAMICS; TRANSIENT CHAOS; TRAVELING SALESMAN PROBLEM;

NEURAL NETWORKS;

ARTICLE; ARTIFICIAL NEURAL NETWORK; CONTROLLED STUDY; MATHEMATICS; PRIORITY JOURNAL;

EID: 0028824103     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/0893-6080(95)00033-V     Document Type: Article

References (68)

1. A learning algorithm for Boltzmann Machines
2. An analysis of associative dynamics in a chaotic neural network with external stimulation
3. Chaotic neural networks
4. Chaotic neural networks
5. The gaussian machine a stochastic neural network for solving assignment problems
6. Proof verification and hardness of approximation problems
7. New optimization methods from physics and biology
8. Application of chaotic simulation and selforganizing neural net to power system voltage stability monitoring
9. Optimal generation unit maintenance scheduling for multi-area system with network contraints
10. Generators maintenance scheduling based on maximum neural network
11. Generators maintenance scheduling based on transient chaotic neural network
12. Chaotic simulated annealing and its application to a maintenance scheduling problem in a power system
13. Chaotic simulated annealing for combinatorial optimization
14. Transient chaotic neural networks and chaotic simulated annealing
15. Worst-case analysis of a new heuristic for the travelling salesman problem
16. Parallel and deterministic algorithms from MRF's: surface reconstruction
17. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
18. Effects of the chaotic noise on the performance of a neural network model
19. Deterministic Boltzmann learning performs steepest descent in weight-space
20. Neural networks and physical systems with emergent collective computational abilities
21. Neurons with graded response have collective computational properties like those of two-state neurons
22. Neural computation of decisions in optimization problems
23. Switched-capacitor chaotic neural networks for traveling salesman problem
24. Methods of combinatorial optimization-from the example of the traveling salesman problem
25. Combinatorial optimization and its complexity
26. Simulated annealing: practice versus theory
27. Genetic algorithms and very fast simulated reannealing: a comparison
28. A chaos neuro-computer
29. More approaches to the traveling salesman guide
30. How easy is local search?
31. Optimization by simulated annealing: an experimental evaluation; Part 1, graph partitioning
32. Optimization by simulated annealing an experimental evaluation; Part II graph coloring and number partitioning
33. Mean field fluctuation of a network of chaotic elements
34. Reducibility among combinatorial problems
35. Optimization by simulated annealing
36. Invitation to the traveling salesman problem
37. Invitation to the traveling salesman problem
38. Invitation to the traveling salesman problem
39. Hardware annealing in electronic neural networks
40. An effective heuristic algorithm for the traveling salesman problem
41. Bases and applications of neurocomputing
42. Simple mathematical models with very complicated dynamics
43. Equation of state calculation by fast computing machines
44. Exact solution of large asymmetric traveling salesman problems
45. Memory search using complex dynamics in a recurrent neural network model
46. A neural network model as a globally coupled map and applications based on chaos
47. Solution of the optimization problem using the neural network model as a globally coupled map
48. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
49. Optimization, approximation, and complexity classes
50. A mean field theory algorithm for neural networks
51. Artificial neural networks
52. TSPLIB-A traveling salesman library
53. Simulated annealing-basics and recent topics on simulated annealing
54. Chaos in random neural networks
55. Fast simulated annealing
56. Proposal of chaotic steepest descent method for neural networks and analysis of their dynamics
57. The significance of the concept “chaos”
58. Dynamic link of memory—chaotic memory map in nonequilibrium neural networks
59. Approximate solvability of NP-like problems
60. Solving degenerate optimization problems using networks of neural oscillators
61. On the stability of the traveling salesman problem algorithm of Hopfield and Tank
62. Chaotic neural networks and the traveling salesman problem
63. Model of biological pattern recognition with spatially chaotic dynamics
64. Heuristic methods and applications: a categorized survey