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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Expert systems with applications Jg. 38; H. 12; S. 14870 - 14881
Hauptverfasser:	Wang, Jiahai, Zhou, Ying, Yin, Jian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.11.2011
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!