Abstract
In this paper an efficient graph coloring algorithm based on the transiently chaotic neural network (TCNN) is presented. This algorithm apply the TCNN with hysteretic output function instead of logistic output function, this make the model has higher ability of overcoming drawbacks that suffer from the local minimum. Meanwhile, a rapid strategy is merged in this model in order to avoid oscillation and offer a considerable acceleration of converging to the optimal solution. The numerical simulation results demonstrated that the proposed model has higher ability and more rapid speed to search for globally optimal solution of the graph coloring problem than the previous TCNN model with logistic output function and without the rapid strategy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hopfield, J.J., Tank, D.W.: “Neural” Computation of Decisions in Optimization Problems. Biolog. Cybern. 52, 141–152 (1985)
Takefuji, Y., Lee, K.C.: Artificial neural networks for four-coloring map problems and K-colorability problems. IEEE Trans. Neural Networks 38(3), 326–333 (1991)
Chen, L., Aihara, K.: Chaotic simulated annealing by a neural network model with transient chaos. Neural Networks 8(6), 915–930 (1995)
Wang, X.H., Wang, Z.O., Qiao, Q.L.: Artificial neural network with transient chaos for four-coloring map problems and k-colorability problems. System Engineering–Theory and Practice 22(5), 92–96 (2002)
Nakagawa, M.: An Artificial Neuron Model with a Periodic Activation Function. Journal of the Physical Society of Japan 64, 1023 (1995)
Wang, X.H., Qiao, Q.L.: Solving Graph Coloring Problems Based on a Chaos Neural Network with Non-monotonous Activation Function. In: Proceedings of Fifth International Conference on Neural Computation, vol. 1, pp. 404–517 (2009)
Kindo, T., Kakeya, H.: A geometrical analysis of associative memory. Neural Networks 11, 39–51 (1998)
Appel, K., Haken, W.: The solution of the four-color-map problem. Scientific American (10), 108–121 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, X., Qiao, Q. (2011). An Efficient Graph Coloring Algorithm by Merging a Rapid Strategy into a Transiently Chaotic Neural Network with Hysteretic Output Function. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23896-3_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-23896-3_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23895-6
Online ISBN: 978-3-642-23896-3
eBook Packages: Computer ScienceComputer Science (R0)