By Topic

Improving Search Efficiency Adopting Hill-Climbing to Ant Colony Optimization 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
$31 $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

4 Author(s)
Hayakawa, D. ; Dept. of Comput. Sci., Takushoku Univ., Tokyo, Japan ; Mizuno, K. ; Sasaki, H. ; Nishihara, S.

To efficiently solve large-scale constraint satisfaction problems, CSPs, we propose an ant colony optimization based meta-heuristics combined with the hill-climbing approach. In our method, in order to improve search inefficiency which happens due to slow reconstruction of assignments of values to variables in the naive ant system, AS, min-conflict hill-climbing is applied to some assignments constructed ones by AS. This method is applied to large-scale and hard binary CSP instances in phase transition regions, whose experimental simulations demonstrate that our method is more efficient than AS.

Published in:

Knowledge and Systems Engineering (KSE), 2011 Third International Conference on

Date of Conference:

14-17 Oct. 2011