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

► This paper combines a tabu Hopfield neural network (THNN) with estimation of distribution algorithm (EDA) for combinatorial optimization problems. ► The short term memory of the tabu mechanism in THNN cooperates with the long term memory mechanism in EDA to help the network escape from local minim...

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 38; no. 12; pp. 14870 - 14881
Main Authors:	Wang, Jiahai, Zhou, Ying, Yin, Jian
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.2011
Subjects:	Algorithms Benchmarking Combinatorial analysis Combinatorial optimization problem Computer simulation Discrete Hopfield neural network Estimation of distribution Mathematical models Maximum cut problem Networks Quadratic programming Searching Tabu search Unconstrained binary quadratic programming problem Discrete Hopfield neural network Maximum cut problem Tabu search Estimation of distribution Unconstrained binary quadratic programming problem Combinatorial optimization problem
ISSN:	0957-4174, 1873-6793
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!