Parameter tuning of continuous Hopfield network applied to combinatorial optimization

Abstract

The continuous Hopfield network (CHN) has provided a powerful approach to optimization problems and has shown good performance in different domains. However, two primary challenges still remain for this network: defining appropriate parameters and hyperparameters. In this study, our objective is to address these challenges and achieve optimal solutions for combinatorial optimization problems, thereby improving the overall performance of the continuous Hopfield network. To accomplish this, we propose a new technique for tuning the parameters of the CHN by considering its stability. To evaluate our approach, three well-known combinatorial optimization problems, namely, weighted constraint satisfaction problems, task assignment problems, and the traveling salesman problem, were employed. The experiments demonstrate that the proposed approach offers several advantages for CHN parameter tuning and the selection of optimal hyperparameter combinations.