Improved ant colony optimization algorithm for solving constraint satisfaction problem

被引:0
|
作者
Zhang, Yong-Gang [1 ,2 ]
Zhang, Si-Bo [1 ,2 ]
Xue, Qiu-Shi [1 ,2 ]
机构
[1] College of Comprter Science and Technology, Jilin university, Changchun,130012, China
[2] Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Changchun,130012, China
来源
关键词
Arc consistency - Backtracking algorithm - Combinatorial optimization problems - Constraint Solving - Heuristic search - Improved ant colony optimization - New parameters - Parameter adjustments;
D O I
10.11959/j.issn.1000-436x.2015123
中图分类号
学科分类号
摘要
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 algorithms based on heuristic search have been proposed. Two improvements based on ant colony optimization meta-heuristic constraint solving algorithm were presented: First, arc consistency checks was done to preprocess before exploring the search space, Second, a new parameter setting scheme was proposed for ant colony optimization to improve the efficiency of the search. Finally, the improved algorithm is applied to solve random problems and combinatorial optimization problems. The results of the experiment have showed its superiority. ©, 2015, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
相关论文
共 50 条
  • [1] An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem
    Zhang, Qin
    Zhang, Changsheng
    [J]. NEURAL COMPUTING & APPLICATIONS, 2018, 30 (10): : 3209 - 3220
  • [2] An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem
    Qin Zhang
    Changsheng Zhang
    [J]. Neural Computing and Applications, 2018, 30 : 3209 - 3220
  • [3] An Improved Ant Colony Optimization Algorithm for Solving the TSP Problem
    Du, Zhanwei
    Yang, Yongjian
    Sun, Yongxiong
    Zhang, Chijun
    Li, Tuanliang
    [J]. ADVANCED MECHANICAL ENGINEERING, PTS 1 AND 2, 2010, 26-28 : 620 - 624
  • [4] An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem
    Yang, Jingan
    Zhuang, Yanbin
    [J]. APPLIED SOFT COMPUTING, 2010, 10 (02) : 653 - 660
  • [5] Ant Colony Optimization with Negative Feedback for Solving Constraint Satisfaction Problems
    Masukane, Takuya
    Mizuno, Kazunori
    Shinohara, Hiroto
    [J]. 2018 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2018, : 156 - 159
  • [6] On ant colony algorithm for solving continuous optimization problem
    Li Hong
    Xiong Shibo
    [J]. 2008 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2008, : 1450 - 1453
  • [7] A method for solving optimization problem in continuous space using improved ant colony algorithm
    Chen, L
    Shen, J
    Qin, L
    Fan, J
    [J]. DATA MINING AND KNOWLEDGE MANAGEMENT, 2004, 3327 : 61 - 70
  • [8] Improved quantum ant colony algorithm for solving TSP problem
    Ma Ying
    Tian Wei-jian
    Fan Yang-yu
    [J]. 2014 IEEE WORKSHOP ON ELECTRONICS, COMPUTER AND APPLICATIONS, 2014, : 453 - 456
  • [9] Application of an Improved Ant Colony Algorithm in TSP Problem Solving
    Ren, Weide
    Sun, Wenxin
    [J]. 3RD INTERNATIONAL CONFERENCE ON APPLIED ENGINEERING, 2016, 51 : 373 - 378
  • [10] Ant Colony Optimization with Multi-Pheromones for Solving Constraint Satisfaction Problems
    Masukane, Takuya
    Mizuno, Kazunori
    [J]. 2016 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2016, : 110 - 115