An efficient graph coloring algorithm by merging a rapid strategy into a transiently chaotic neural network with hysteretic output function

Authors:
Xiuhong Wang;Qingli Qiao
Affiliations:
College of Management and Economics, Tianjin University, Tianjin, China;Department of Biomedical Engineering, Tianjin Medical University, Tianjin, China
Venue:
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part III
Year:
2011

Citing 3
Cited 0

Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
A geometrical analysis of associative memory

Neural Networks
Solving Graph Coloring Problems Based on a Chaos Neural Network with Non-monotonous Activation Function

ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 01

Quantified Score

Hi-index	0.00

Visualization

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.