OPT-FRAC-CHN: Optimal Fractional Continuous Hopfield Network

Abstract

The continuous Hopfield network (CHN) is a common recurrent neural network. The CHN tool can be used to solve a number of ranking and optimization problems, where the equilibrium states of the ordinary differential equation (ODE) related to the CHN give the solution to any given problem. Because of the non-local characteristic of the “infinite memory” effect, fractional-order (FO) systems have been proved to describe more accurately the behavior of real dynamical systems, compared to the model’s ODE. In this paper, a fractional-order variant of a Hopfield neural network is introduced to solve a Quadratic Knap Sac Problem (QKSP), namely the fractional CHN (FRAC-CHN). Firstly, the system is integrated with the quadratic method for fractional-order equations whose trajectories have shown erratic paths and jumps to other basin attractions. To avoid these drawbacks, a new algorithm for obtaining an equilibrium point for a CHN is introduced in this paper, namely the optimal fractional CHN (OPT-FRAC-CHN). This is a variable time-step method that converges to a good local minima in just a few iterations. Compared with the non-variable time-stepping CHN method, the optimal time-stepping CHN method (OPT-CHN) and the FRAC-CHN method, the OPT-FRAC-CHN method, produce the best local minima for random CHN instances and for the optimal feeding problem.

Keywords

• fractional calculus (FC)
• continuous Hopfield network (CHN)
• equilibrium point (EP)
• quadratic knap sac problem (QKSP)