05718545

j

05718545 Salcedo-Sanz, Sancho Ortiz-Garc{\'\i}a, Emilio G. P\'erez-Bellido, Angel M. Portilla-Figueras, Jose A. Using a bank of binary Hopfield networks as constraints solver in hybrid algorithms. Neurocomputing 71, No. 4-6, 1061-1068 (2008). 2008 Elsevier Science Publishers B.V., Amsterdam EN bank of Hopfield networks hybrid algorithms combinatorial optimization problems light-up puzzle crossbar switch problem

doi:10.1016/j.neucom.2007.10.010

Summary: This paper proposes the use of a bank of Hopfield networks to solve a class of constraints which appear in combinatorial optimization problems. Specifically, we deal with problems which constraints' structure can be represented by a binary matrix $C$, and can be separated in independent substructures. We show that a bank of Hopfield networks can solve these constraints, and also can be easily hybridized with a global search algorithm, such as simulated annealing, to obtain a final solution to the problem. We apply our approach to the solution of a famous logic-type puzzle, the light-up puzzle, where we report improvements over a branch and bound algorithm, and to an important problem which arises in electronic control: the so-called Crossbar Switch Problem.