作者: Enrique Mérida Casermeiro , Domingo López-Rodríguez , Juan Miguel Ortiz-de-Lazcano-Lobato
DOI:
关键词:
摘要: In this work a new algorithm to improve the performance of opti- mization methods, by means avoiding certain local optima, is described. Its theoretical bases are presented in rigorous, but intuitive, way. It has been ap- plied concretely case recurrent neural networks, particular MREM, multivalued model, that proved obtain very good results when dealing with NP-complete combinatorial optimization problems. order show its efficiency, well-known MaxCut problem for graphs selected as ben- chmark. Our proposal outperforms other specialized and powerful techniques, shown simulations.