论文部分内容阅读
设计一种二元蚁群算法.该算法是将每只“蚂蚁”站在原地构成一维线性队列彼此之间传递信号,并且信号经过每只“蚂蚁”时,“蚂蚁”根据自身的信息素随机选择状态(0或1).由于采用二进制编码对单个蚂蚁的智能行为要求较低,对应的存储空间相对较少,使得算法效率有较大提高,并且实现也较为简单.通过测试函数优化和多维0/1背包问题结果表明该算法具有较好的收敛速度和稳定性,求解结果较好.
A two-element ant colony algorithm is designed, in which each “ant” stands in a one-dimensional linear queue to transmit signals between each other and the signal passes through each “ant”, “ant” "According to their own pheromone randomly select the state (0 or 1) .Because of the binary code on a single intelligent ant behavior requirements are relatively low, the corresponding storage space is relatively small, making the algorithm has greatly improved efficiency, and the realization is relatively simple Through the test function optimization and multidimensional 0/1 knapsack problem, the results show that the algorithm has better convergence speed and stability, and the solution is better.