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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Expert systems with applications Ročník 38; číslo 12; s. 14870 - 14881
Hlavní autoři:	Wang, Jiahai, Zhou, Ying, Yin, Jian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.11.2011
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!