Abstract
We proposed a neural network called LPPH-CSP for solving constraint satisfaction problem (CSP). The LPPH-CSP is not trapped by any point which is not a solution of the CSP, and it can update all neurons simultaneously. In this paper, we propose two methods to improve the efficiency of the LPPH-CSP. Though the LPPH-CSP can deal with several types of constraints of the CSP, it treats all constraints evenly. One of the proposed methods distinguishes the types of constraints for solving the CSP more efficiently. Another one of the proposed methods applies fast local search (FLS) to the LPPH-CSP. Experimental results show the effectiveness of our proposals.
Chapter PDF
References
T. Nakano and M. Nagamatu, “Solving CSP via Neural Network Which Can Update All Neurons Simultaneously”, In Proceedings of the SCIS & ISIS 2004, (to appear).
M. Nagamatu and T. Yanaru, “On the Stability of Lagrange Programming Neural Networks for Satisfiability Problems of Propositional Calculus”, Neurocomputing, 13, 119–133, 1995.
C. Voudouris, and E. Tsang, “Partial Constraint Satisfaction Problems and Guided Local Search”, In Proceedings of the PACT-96, 337–356, 1996.
J.L. Bently, “Fast Algorithms for Geometric Traveling Salesman Problems”, ORSA Journal on Computing, 4, 387–441, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Nakano, T., Nagamatu, M. (2005). Solving CSP by Lagrangian Method with Importance of Constraints. In: Shi, Z., He, Q. (eds) Intelligent Information Processing II. IIP 2004. IFIP International Federation for Information Processing, vol 163. Springer, Boston, MA. https://doi.org/10.1007/0-387-23152-8_33
Download citation
DOI: https://doi.org/10.1007/0-387-23152-8_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23151-8
Online ISBN: 978-0-387-23152-5
eBook Packages: Computer ScienceComputer Science (R0)