Competitive Hopfield Network Combined With Estimation of Distribution for Maximum Diversity Problems

This paper presents a discrete competitive Hopfield neural network (HNN) (DCHNN) based on the estimation of distribution algorithm (EDA) for the maximum diversity problem. In order to overcome the local minimum problem of DCHNN, the idea of EDA is combined with DCHNN. Once the network is trapped in local minima, the perturbation based on EDA can generate a new starting point for DCHNN for further search. It is expected that the further search is guided to a promising area by the probability model. Thus, the proposed algorithm can escape from local minima and further search better results. The proposed algorithm is tested on 120 benchmark problems with the size ranging from 100 to 5000. Simulation results show that the proposed algorithm is better than the other improved DCHNN such as multistart DCHNN and DCHNN with random flips and is better than or competitive with metaheuristic algorithms such as tabu-search-based algorithms and greedy randomized adaptive search procedure algorithms.

[1]  Kate A. Smith,et al.  Hopfield neural networks for timetabling: formulations, methods, and comparative results , 2003 .

[2]  Luiz Satoru Ochi,et al.  New heuristics for the maximum diversity problem , 2007, J. Heuristics.

[3]  Kazuyuki Aihara,et al.  Chaotic simulated annealing by a neural network model with transient chaos , 1995, Neural Networks.

[4]  S. Martins,et al.  MIC 2003 : The Fifth Metaheuristics International Conference ? ?-1 GRASP for the maximum diversity problem , 2005 .

[5]  Gintaras Palubeckis,et al.  Iterated tabu search for the maximum diversity problem , 2007, Appl. Math. Comput..

[6]  Nobuo Funabiki,et al.  A Gradual Neural Network Algorithm for Broadcast Scheduling Problems in Packet Radio Networks (Special Section on Discrete Mathematics and Its Applications) , 1999 .

[7]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[8]  F. Glover,et al.  Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming* , 1993 .

[9]  Yoshiyasu Takefuji,et al.  A neural network parallel algorithm for channel assignment problems in cellular radio networks , 1992 .

[10]  Mustapha Nourelfath,et al.  Quantized hopfield networks for reliability optimization , 2003, Reliab. Eng. Syst. Saf..

[11]  Qingfu Zhang,et al.  Iterated Local Search with Guided Mutation , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[12]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[13]  Jay B. Ghosh,et al.  Computational aspects of the maximum diversity problem , 1996, Oper. Res. Lett..

[14]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[15]  Hongmei He,et al.  An Improved Neural Network Model for the Two-Page Crossing Number Problem , 2006, IEEE Transactions on Neural Networks.

[16]  Fred Glover,et al.  A discrete optimization model for preserving biological diversity , 1995 .

[17]  Nobuo Funabiki,et al.  A binary Hopfield neural-network approach for satellite broadcast scheduling problems , 1997, IEEE Trans. Neural Networks.

[18]  Yoichi Takenaka,et al.  An expanded maximum neural network algorithm for a channel assignment problem in cellular radio networks , 2000 .

[19]  José Muñoz-Pérez,et al.  Design and analysis of maximum Hopfield networks , 2001, IEEE Trans. Neural Networks.

[20]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[21]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[22]  Elder M. Macambira.  An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem , 2002, Ann. Oper. Res..

[23]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[24]  Barun Chandra,et al.  Approximation Algorithms for Dispersion Problems , 2001, J. Algorithms.

[25]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[26]  Rex K. Kincaid.  Good solutions to discrete noxious location problems via metaheuristics , 1992, Ann. Oper. Res..

[27]  Abder Koukam,et al.  A memetic neural network for the Euclidean traveling salesman problem , 2009, Neurocomputing.

[28]  Alexandre Plastino,et al.  GRASP with Path-Relinking for the Maximum Diversity Problem , 2005, WEA.

[29]  Ulrich Faigle,et al.  A Lagrangian relaxation approach to the edge-weighted clique problem , 2001, Eur. J. Oper. Res..

[30]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[31]  Yoshiyasu Takefuji,et al.  Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks , 1993, IEEE Trans. Computers.

[32]  Roberto Cordone,et al.  Better and faster solutions for the maximum diversity problem , 2006 .

[33]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[34]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[35]  Qingfu Zhang,et al.  Combinations of estimation of distribution algorithms and other techniques , 2007, Int. J. Autom. Comput..

[36]  Guanghui Lan,et al.  On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem , 2006, Comput. Ind. Eng..

[37]  Satoshi Matsuda,et al.  Quantized Hopfield networks for integer programming , 1999, Systems and Computers in Japan.

[38]  Cid C. de Souza,et al.  The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations , 2000, Eur. J. Oper. Res..

[39]  Qingfu Zhang,et al.  Evolutionary Algorithms Refining a Heuristic: A Hybrid Method for Shared-Path Protections in WDM Networks Under SRLG Constraints , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[40]  S. S. Ravi,et al.  Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..

[41]  Nobuo Funabiki,et al.  A gradual neural-network approach for frequency assignment in satellite communication systems , 1997, IEEE Trans. Neural Networks.

[42]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[43]  Michael M. Sørensen,et al.  New facets and a branch-and-cut algorithm for the weighted clique problem , 2004, Eur. J. Oper. Res..

[44]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[45]  Refael Hassin,et al.  Approximation algorithms for maximum dispersion , 1997, Oper. Res. Lett..

[46]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[47]  Abraham Duarte,et al.  Tabu search and GRASP for the maximum diversity problem , 2007, Eur. J. Oper. Res..

[48]  Luiz Satoru Ochi,et al.  Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem , 2004, WEA.

[49]  Michael Kuby.  Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems , 1988 .

[50]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[51]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[52]  Ondrej Sýkora,et al.  A Hopfield Neural Network Model for the Outerplanar Drawing Problem , 2006, IMECS.

[53]  Roberto Cordone,et al.  Tabu Search versus GRASP for the maximum diversity problem , 2008, 4OR.

[54]  Wen Liu,et al.  Noisy Chaotic Neural Networks With Variable Thresholds for the Frequency Assignment Problem in Satellite Communications , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[55]  Ram Dantu,et al.  An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[56]  José Muñoz,et al.  A neural model for the p-median problem , 2008, Comput. Oper. Res..

[57]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[58]  Jiahai Wang,et al.  A binary Hopfield neural network with hysteresis for large crossbar packet-switches , 2005, Neurocomputing.

[59]  Fred W. Glover,et al.  Solving the maximum edge weight clique problem via unconstrained quadratic programming , 2007, Eur. J. Oper. Res..

[60]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[61]  Jun Wang,et al.  Digital hardware realization of a recurrent neural network for solving the assignment problem , 2003, Neurocomputing.