0-1规划问题的元胞蝙蝠算法  

Cellular bat algorithm for 0-1 programming problem

作　　者：李枝勇[1] 马良[1] 张惠珍[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《计算机应用研究》2013年第10期2903-2906,2935,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(70871081);上海市一流学科建设资助项目(S1205YLXK);上海市研究生创新基金资助项目(JWCXSL1202)

摘　　要：基于元胞自动机原理和蝙蝠算法,提出了一种求解0-1规划问题的元胞蝙蝠算法。利用元胞及其邻居增强搜索过程的多样性,提高算法的全局寻优能力,通过罚函数的方法将约束问题转换为相应的无约束问题,给出了元胞蝙蝠算法的具体步骤,并用MATLAB软件编程实现。通过对多个0-1规划问题的算例进行测试,并将测试结果与其他算法进行比较,结果表明,元胞蝙蝠算法具有较快的收敛速度和较好的全局寻优能力,可作为求解0-1规划问题的一种实用方法。This paper proposed cellular bat algorithm to solve O- 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 im- prove 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 O- 1 programming problem test and comparisons with other algorithms, the results show that cellular bat algorithm has fast conver- gence speed and better global optimization ability. It can be used as a practical approach to solve O- 1 programming problem.

关 键 词：0—1规划问题 元胞自动机 蝙蝠算法 优化 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]