%0 Journal Article
%T An Approach to a Constraint Satisfaction Problem Using Genetic Algorithm<br>一个约束可满足性问题的演化算法求解
%A LI Jing-Zhi KANG Li-Shan FANG Ming
%A <br>李景治
%A 康立山
%A 方宁
%J 计算机科学
%D 2004
%I 
%X Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints. Based on the framework of evolutionary algorithm (EA), we solve the zebra-belong-to-who problem, a classical constraint satisfaction problem in this paper. We devise the matrix encoding and its corresponding crossover and mutation operators. Experiments show that EA can solve the problem effectively.
%K Constraint satisfaction problem
%K Evolutionary algorithm
%K Zebra-belong-to-who problem<br>约束可满足性问题
%K 演化算法
%K 斑马属谁问题
%K 优化问题
%K 计算机
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=FD7A260387BDBCAD&yid=D0E58B75BFD8E51C&vid=4AD960B5AD2D111A&iid=E158A972A605785F&sid=205BE674D84A456D&eid=12DC19455C3A2FA8&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=4