Abstract
GENET model has attracted much attention for its special feature in solving constraint satisfaction problems. However, the parameter setting problems have not been discussed in detail. In this paper, the convergent behavior of GENET is thoroughly analyzed and its learning strategy is generalized. The obtained results can shed light on choosing parameter values and exploiting problem specific information.
Supported by the Nature Science Foundation of China under Grant 60473034 and the Youth Science Foundation of Shanxi Province under Grant 20031028.
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
Milis, P., Tsang, E.P.K.: Guided Local Search for Solving SAT andWeighted MAXSAT Problems. Journal of Automated Reasoning 24, 205–223 (2000)
Tsang, E.P.K., Wang, C.-J., Davenport, A., Voudouris, C., Lau, T.-L.: A Family of Stochastic Methods for Constraint Satisfaction and Optimization. In: The First International Conference on The Practical Application of Constraint Technologies and Logic Programming, London, April 1999, pp. 359–383 (1999)
Voudouris, C., Tsang, E.P.K.: Guided Local Search and Its Application to the Traveling Salesman Problem. European Journal of Operational Research 113, 469–499 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Xu, Z., Cao, F. (2005). Generalization and Property Analysis of GENET. In: Wang, J., Liao, X., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427391_9
Download citation
DOI: https://doi.org/10.1007/11427391_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25912-1
Online ISBN: 978-3-540-32065-4
eBook Packages: Computer ScienceComputer Science (R0)