1. On the performance of the LP-guided Hopfield network-genetic algorithm
- Author
-
Salcedo-Sanz, Sancho, Ortiz-Garcia, Emilio G., Perez-Bellido, ANgel M., Portilla-Figueras, Antonio, and Lopez-Ferreras, Francisco
- Subjects
Algorithm ,Mathematical optimization -- Analysis ,Algorithms -- Analysis - Abstract
To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cor.2008.08.012 Byline: Sancho Salcedo-Sanz, Emilio G. Ortiz-Garcia, Angel M. Perez-Bellido, Antonio Portilla-Figueras, Francisco Lopez-Ferreras Abstract: This paper proposes a linear programming (LP)-guided Hopfield-genetic algorithm for a class of combinatorial optimization problems which admit a 0-1 integer linear programming. The algorithm modifies the updating order of the binary Hopfield network in order to obtain better performance of the complete hybrid approach. We theoretically analyze several different updating orders proposed. We also include in the paper a novel proposal to guide the Hopfield network using the crossover and mutation operators of the genetic algorithm. Experimental evidences that show the good performance of the proposed approach in two different combinatorial optimization problems are also included in the paper. Author Affiliation: Department of Signal Theory and Communications, Universidad de Alcala de Henares, Campus Universitario, 28871 Alcala de Henares, Madrid, Spain Article Note: (footnote) [star] This work has been partially supported by Universidad de Alcala and Comunidad de Madrid with a Grant no. CCG07-UAH/TIC-1894, and by Ministerio de Educacion with a Grant no. TEC 2006-07010/TCM. A.M. Perez-Bellido and E.G. Ortiz-Garcia are supported by Universidad de Alcala, under the University F.P.I. grants program.
- Published
- 2009