欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出一种新的优化算法，元胞蚂蚁算法，该算法将元胞自动机的邻居和规则引入传统的蚂蚁算法，实验结果证明该算法可行且有效，有良好的全局优化能力。定义元胞蚂蚁算法的求解迭代过程为一个概率测度空间中的随机算子，利用随机不动点理论，证明了该算子为连续压缩算子，存在唯一的随机不动点，从而给出了元胞蚂蚁算法的收敛性的论证，为算法奠定了相应的理论基础。
英文摘要：
A new optimization algorithm-cellular ant algorithm was proposed. The proposed algorithm introduces the concept of neighborhood and the rule of cellular automata into the conventional ant algorithm. Experimental results of numerical simulation show the robustness and efficiency of the algorithm. The process of iterative problem solving of cellular ant algorithm was defined as a random operator of probability measure space. The proof of the operator was a continuous and compress operator and has only random fixed point by the theory of random fixed point. So the convergence proof of cellular ant algorithm was given, which makes the relevant theoretical foundation of the convergence property of the algorithm.
同期刊论文项目
同项目期刊论文
期刊信息
位置：