In order to enhance the applying efficiency of cl , the cause of premature convergence in binary - coded genetic algorithms ( gas ) is analyzed in this dissertation . the drawback of conventional mutation operator in preventing premature convergence is subsequently pointed out . whereafter , a genetic algorithm , which can be implemented via general logic gate circuit , is proposed 为了提高计算智能的应用效率,本文分析了二进制遗传算法中早熟收敛的成因,指出了传统的变异算子在防止早熟收敛方面的不足,提出了一种能有效预防早熟现象的二元变异算子,并在此基础上提出了一种便于用常规逻辑门电路实现的遗传算法。
To obtain the better total solution , some modifications to acoas were adopted , in which , more decision points were put in for the binary - coded method and only the best ant was allowed to provide a feedback mechanism by updating the pheromone trails which were limited to an interval between some maximum and minimum possible values 为了更好地得到全局最优解,对算法进行了改进,加入了更多的决策点,实现蚁群算法的二进制编码方法,并采用单只最优蚂蚁更新路径上的外激素值、外激素值限定在一定范围内等改进方法。