Improved ant colony optimization algorithm for solving constraint satisfaction problem

Improved ant colony optimization algorithm for solving constraint satisfaction problem

Show other versions (1)

The traditional backtracking algorithm was less efficient on solving large-scale constraint satisfaction problem,and more difficult to be solved within a reasonable time.In order to overcome this problem,many incompleteness algo-rithms based on heuristic search have been proposed.Two improvements ba...

Full description

Bibliographic Details
Main Authors: HANGYong-gang Z, HANGSi-bo Z, UEQiu-shi X
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2015-05-01
Series:Tongxin xuebao
Subjects:
constraint satisfaction problems
ant colony optimization
arc consistency
parameter adjustment
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015123/

Internet

http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015123/

Similar Items