CAJ | 학술논문

基于元胞自动机原理和蝙蝠算法, 提出了一种求解0-1规划问题的元胞蝙蝠算法。利用元胞及其邻居增强搜索过程的多样性, 提高算法的全局寻优能力, 通过罚函数的方法将约束问题转换为相应的无约束问题, 给出了元胞蝙蝠算法的具体步骤, 并用MATLAB软件编程实现。通过对多个0-1规划问题的算例进行测试, 并将测试结果与其他算法进行比较, 结果表明, 元胞蝙蝠算法具有较快的收敛速度和较好的全局寻优能力, 可作为求解0-1规划问题的一种实用方法。
기우원포자동궤원리화편복산법, 제출료일충구해0-1규화문제적원포편복산법。이용원포급기린거증강수색과정적다양성, 제고산법적전국심우능력, 통과벌함수적방법장약속문제전환위상응적무약속문제, 급출료원포편복산법적구체보취, 병용MATLAB연건편정실현。통과대다개0-1규화문제적산례진행측시, 병장측시결과여기타산법진행비교, 결과표명, 원포편복산법구유교쾌적수렴속도화교호적전국심우능력, 가작위구해0-1규화문제적일충실용방법。
This paper proposed cellular bat algorithm to solve 0-1 programming problem, which was based on the principles of cellular automata and bat algorithm. It used cellular and its neighbor to enhance the diversity of the searching process to improve the ability of global optimization, and transformed the constrained problem into the unconstrained problem using penalty function and then described the detailed procedures of the algorithm and programmed with MATLAB software. By some 0-1 programming problem test and comparisons with other algorithms, the results show that cellular bat algorithm has fast convergence speed and better global optimization ability. It can be used as a practical approach to solve 0-1 programming problem.