Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem

Authors:
Jiahai Wang
Affiliations:
Department of Computer Science, Sun Yat-sen University, No. 132, Waihuan East Road, Guangzhou Higher Education Mega Center, Guangzhou 510006, PR China
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 32
Cited 1

Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Mathematical Programming: Series A and B
A scatter search approach to unconstrained quadratic binary programs

New ideas in optimization
A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function

Computers and Industrial Engineering
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

Neural Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Survey of Optimization by Building and Using Probabilistic Models

Computational Optimization and Applications
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Journal of Heuristics
Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks

IEEE Transactions on Computers
Hopfield neural networks for timetabling: formulations, methods, and comparative results

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
Optimizing neural networks on SIMD parallel computers

Parallel Computing
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem

Computers and Industrial Engineering
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Journal of Heuristics
A neural model for the p-median problem

Computers and Operations Research
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

Informatica
A memetic neural network for the Euclidean traveling salesman problem

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

Neurocomputing
Noisy Chaotic Neural Networks With Variable Thresholds for the Frequency Assignment Problem in Satellite Communications

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
The compact genetic algorithm

IEEE Transactions on Evolutionary Computation
Evolutionary Algorithms Refining a Heuristic: A Hybrid Method for Shared-Path Protections in WDM Networks Under SRLG Constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A binary Hopfield neural-network approach for satellite broadcast scheduling problems

IEEE Transactions on Neural Networks
A gradual neural-network approach for frequency assignment in satellite communication systems

IEEE Transactions on Neural Networks
Design and analysis of maximum Hopfield networks

IEEE Transactions on Neural Networks
An Improved Neural Network Model for the Two-Page Crossing Number Problem

IEEE Transactions on Neural Networks

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is a unified model for a variety of combinatorial optimization problems. This paper presents a discrete Hopfield neural network (DHNN) combined with estimation of distribution algorithm (EDA) for the UBQP. The idea of EDA is combined with the DHNN in order to overcome the local minima problem of the network. Once the network is trapped in local minima, the perturbation based on EDA can generate a new starting point for the DHNN for further search, which is in a promising area characterized by a probability model. Thus, the proposed algorithm, named DHNN-EDA, can escape from local minima and further search better results. The DHNN-EDA is tested on a large number of benchmark problems with size up to 7000 variables. Simulation results on the UBQP show that the DHNN-EDA is better than the other improved DHNN algorithms such as multi-start DHNN and DHNN with random flips, and is better than or competitive with metaheuristic algorithms such as simulated annealing, tabu search, scatter search and memetic algorithm.