By Topic

Genetic algorithms for constraint satisfaction problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. Kanoh ; Tsukuba Univ., Ibaraki, Japan ; M. Matsumoto ; S. Nishihara

Several approximate algorithms using hill-climbing techniques and neural networks have been proposed to solve large constraint satisfaction problems (CSPs) in a practical time. In these proposals, many methods of escaping from local optima are discussed, however, there are very few methods actively perform global search. In this paper we propose a hybrid search method that combines the genetic algorithm with the min-conflicts hill-climbing (MCHC). In our method, the individual that has the fewest conflicts in the population is used as the initial value of MCHC to search locally. The detailed experimental simulation is also performed to prove that the proposed method generally gives better efficiency than the random restarting MCHC when CSPs are sparsely-connected

Published in:

Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:1 )

Date of Conference:

22-25 Oct 1995