Chaotic Neurodynamics in the Frequency Assignment Problem

Abstract

The frequency assignment problem belongs to the quite difficult to deal with class of NP (nondeterministic polynomial) - hard combinatorial optimization problems [3]. Its computational complexity directs researchers in the field at developing efficient techniques for finding solutions realizing minimum (or maximum) values of an objective function subject to a set of, often conflicting, constraints. To seek an optimal (or near optimal) solution, many methods have been proposed, such as dynamic programming methods, branch and bound methods, etc., and, lately, some heuristic algorithms relating to physical and biological phenomena. They include tabu search, genetic algorithms, simulated annealing and artificial neural networks [4]. We propose a Hop-field neural network model with chaotic neurodynamics to overcome the obstacle of local minima in the energy function and obtain optimal solutions in less iterations than the time-consuming convergent dynamics.