Letters: Using a bank of binary Hopfield networks as constraints solver in hybrid algorithms

Authors:
Sancho Salcedo-Sanz;Emilio G. Ortiz-García;Angel M. Pérez-Bellido;Jose A. Portilla-Figueras
Affiliations:
Department of Signal Theory and Communications, Universidad de Alcalá, Escuela Politecnica Superior, 28871 Alcala de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Escuela Politecnica Superior, 28871 Alcala de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Escuela Politecnica Superior, 28871 Alcala de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Escuela Politecnica Superior, 28871 Alcala de Henares, Madrid, Spain
Venue:
Neurocomputing
Year:
2008

Citing 11
Cited 0

A bank of Hopfield neural networks for the shortest path problem

Signal Processing
A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
Using a Computer Game to Develop Advanced AI

Computer
Applying Inexpensive AI Techniques to Computer Games

IEEE Intelligent Systems
A Discrete-Time Quantized-State Hopfield Neural Network

Annals of Mathematics and Artificial Intelligence
A portable and scalable algorithm for a class of constrained combinatorial optimization problems

Computers and Operations Research
Letters: Optimal solution to crossbar packet-switch problems using a sequential binary Hopfield neural network

Neurocomputing
Letter: A binary Hopfield neural network with hysteresis for large crossbar packet-switches

Neurocomputing
A mixed neural-genetic algorithm for the broadcast scheduling problem

IEEE Transactions on Wireless Communications
Web newspaper layout optimization using simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Neural techniques for combinatorial optimization with applications

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.