Optimization Using Hopfield Network

Optimization is an action of making something such as design, situation, resource, and system as effective as possible. Using a resemblance between the cost function and energy function, we can use highly interconnected neurons to solve optimization problems. Such a kind of neural network is Hopfield network, that consists of a single layer containing one or more fully connected recurrent neurons. This can be used for optimization.

Points to remember while using Hopfield network for optimization −

The energy function must be minimum of the network.

It will find satisfactory solution rather than select one out of the stored patterns.

The quapty of the solution found by Hopfield network depends significantly on the initial state of the network.

Travelpng Salesman Problem

Finding the shortest route travelled by the salesman is one of the computational problems, which can be optimized by using Hopfield neural network.

Basic Concept of TSP

Travelpng Salesman Problem (TSP) is a classical optimization problem in which a salesman has to travel n cities, which are connected with each other, keeping the cost as well as the distance travelled minimum. For example, the salesman has to travel a set of 4 cities A, B, C, D and the goal is to find the shortest circular tour, A-B-C–D, so as to minimize the cost, which also includes the cost of travelpng from the last city D to the first city A.

Matrix Representation

Actually each tour of n-city TSP can be expressed as n &times n matrix whose i_th row describes the i_th city’s location. This matrix, M, for 4 cities A, B, C, D can be expressed as follows −

$$M = egin{bmatrix}A: & 1 & 0 & 0 & 0 \B: & 0 & 1 & 0 & 0 \C: & 0 & 0 & 1 & 0 \D: & 0 & 0 & 0 & 1 end{bmatrix}$$

Solution by Hopfield Network

While considering the solution of this TSP by Hopfield network, every node in the network corresponds to one element in the matrix.

Energy Function Calculation

To be the optimized solution, the energy function must be minimum. On the basis of the following constraints, we can calculate the energy function as follows −

Constraint-I

First constraint, on the basis of which we will calculate energy function, is that one element must be equal to 1 in each row of matrix M and other elements in each row must equal to 0 because each city can occur in only one position in the TSP tour. This constraint can mathematically be written as follows −

$$displaystylesumpmits_{j=1}^n M_{x,j}:=:1:for : x:in :lbrace1,...,n brace$$

Now the energy function to be minimized, based on the above constraint, will contain a term proportional to −

$$displaystylesumpmits_{x=1}^n left(egin{array}{c}1:-:displaystylesumpmits_{j=1}^n M_{x,j}end{array} ight)^2$$

Constraint-II

As we know, in TSP one city can occur in any position in the tour hence in each column of matrix M, one element must equal to 1 and other elements must be equal to 0. This constraint can mathematically be written as follows −

$$displaystylesumpmits_{x=1}^n M_{x,j}:=:1:for : j:in :lbrace1,...,n brace$$

Now the energy function to be minimized, based on the above constraint, will contain a term proportional to −

$$displaystylesumpmits_{j=1}^n left(egin{array}{c}1:-:displaystylesumpmits_{x=1}^n M_{x,j}end{array} ight)^2$$

Cost Function Calculation

Let’s suppose a square matrix of (n × n) denoted by C denotes the cost matrix of TSP for n cities where n > 0. Following are some parameters while calculating the cost function −

C_{x, y} − The element of cost matrix denotes the cost of travelpng from city x to y.

Adjacency of the elements of A and B can be shown by the following relation −

$$M_{x,i}:=:1:: and:: M_{y,ipm 1}:=:1$$

As we know, in Matrix the output value of each node can be either 0 or 1, hence for every pair of cities A, B we can add the following terms to the energy function −

$$displaystylesumpmits_{i=1}^n C_{x,y}M_{x,i}(M_{y,i+1}:+:M_{y,i-1})$$

On the basis of the above cost function and constraint value, the final energy function E can be given as follows −

$$E:=:frac{1}{2}displaystylesumpmits_{i=1}^ndisplaystylesumpmits_{x}displaystylesumpmits_{y eq x}C_{x,y}M_{x,i}(M_{y,i+1}:+:M_{y,i-1}):+$$

$$:egin{bmatrix}gamma_{1} displaystylesumpmits_{x} left(egin{array}{c}1:-:displaystylesumpmits_{i} M_{x,i}end{array} ight)^2:+: gamma_{2} displaystylesumpmits_{i} left(egin{array}{c}1:-:displaystylesumpmits_{x} M_{x,i}end{array} ight)^2 end{bmatrix}$$

Here, γ₁ and γ₂ are two weighing constants.