Hopfield neural network based on estimation of distribution for two-page crossing number problem

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 55, Issue 8, 2008, Pages 797-801

  Wang, Jiahai ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Combinatorial optimization problem; Estimation of distribution (EDA); Hopfield neural network (HNN); Two page crossing number

Indexed keywords

COMBINATORIAL OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; ESTIMATION OF DISTRIBUTIONS; HOPFIELD NEURAL NETWORKS (HNN); LOCAL MINIMUMS; PROBABILITY MODELING; TWO-PAGE CROSSING NUMBER;

HOPFIELD NEURAL NETWORKS;

EID: 50549093170     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2008.922373     Document Type: Article

References (19)

1. S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa, "Crossing minimization in linear embeddings of graphs," IEEE Trans. Comput. vol. 39, no. 1, pp. 124-127, Jan. 1990.
2. A. L. Rosenberg, "Diogenes, Circa 1986," Lecture Notes in Computer Science, vol. 227, pp. 96-107, 1986, Springer.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, "Algorithms for drawing graphs: An annotated bibliography," Computat. Geometry: Theory Appl., vol. 4, pp. 435-282, 1994.
4. R. Cimikowski and P. Shope, "A neural network algorithm for a graph layout problem," IEEE Trans. Neural Netw., vol. 7, no. 2, pp. 341-346, Mar. 1996.
5. T. A. J. Nicholson, "Permutation procedure for minimizing the number of crossings in a network," Proc. IEEE, vol. 115, no. 1, pp. 21-26, Jan. 1968.
6. R. Cimikowski, "Algorithms for the fixed linear crossing number problem," Discrete Appl. Math., vol. 122, pp. 93-115, 2002.
7. R. L. Wang and K. Okazaki, "An efficient parallel algorithm for the minimum crossing number problem," Neurocomputing, vol. 67, pp. 411-416, 2005.
8. H. He, O. Sykora, and E. Makinen, "An improved neural network model for the two-page crossing number problem," IEEE Trans. Neural Netw., vol. 17, no. 6, pp. 1642-1646, Nov. 2006.
9. H. Muhlenbein and G. Paaß, "From recombination of genes to the estimation of distributions," Lecture Notes in Computer Science, vol. 1411, pp. 178-187, 1996.
10. M. Pelikan, D. E. Goldberg, and F. Lobo, "A survey of optimization by building and using probabilistic models," Computat. Optim. Appl., vol. 21, no. 1, pp. 5-20, 2002.
11. Q. Zhang and J. Sun, "Iterated local search with guided mutation," in Proc. IEEE Congress Evol. Computation, 2006, pp. 924-929.
12. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning," School of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-94-163, 1994.
13. G. R. Harik, F. G. Lobo, and D. E. Goldberg, "The compact genetic algorithm," IEEE Trans. Evol. Comput., vol. 3, no. 4, pp. 287-297, 1999.
14. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
15. L. Chen and K. Aihara, "Chaotic simulated annealing by a neural network model with transient chaos," Neural Networks, vol. 8, no. 6, pp. 915-930, 1995.
16. S. Geman and D. Geman, "Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images," IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-6, pp. 721-741, 1984.
17. L. Wang, W. Liu, H. Shi, and J. M. Zurada, "Cellular neural networks with transient chaos," IEEE Trans. Circuits Syst. II, Exp. Briefs vol. 54, no. 5, pp. 440-444, May 2007.
18. L. Chen and K. Aihara, "Global searching ability of chaotic neural networks," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 46, no. 8, pp. 974-993, Aug. 1999.
19. I. Tokuda, K. Aihara, and T. Nagashima, "Adaptive annealing for chaotic optimization," Phys. Rev. E, vol. 58, pp. 5157-5160, 1998.