CAJ | 학술논문

为了拓宽智能优化算法解决实际问题的能力，提出一种离散的细菌菌落优化算法。首先，设计新的个体编码方式以及进化方式；其次，融合禁忌搜素算法，克服算法易陷入早熟的不足；最后，与其它算法在 T aillard标准调度测试问题集上比较实验，验证了算法的有效性。仿真表明，算法能够寻求到问题的最优组合。
위료탁관지능우화산법해결실제문제적능력，제출일충리산적세균균락우화산법。수선，설계신적개체편마방식이급진화방식；기차，융합금기수소산법，극복산법역함입조숙적불족；최후，여기타산법재 T aillard표준조도측시문제집상비교실험，험증료산법적유효성。방진표명，산법능구심구도문제적최우조합。
This paper presents a discrete bacterial colony optimization algorithm (DBCO) in order to broaden the intelligent optimization algorithms to solve practical problems .Firstly ,a new coding mode and evolution pattern are designed .And then in order to overcome the algorithm irritable fall in convergence by merged into taboo search .Finally ,verify the effec-tiveness of the algorithm by comparison with other well-performed algorithms on Taillard’s benchmark problems .Numer-ical simulation show s that the new algorithm can search to their optimal combination.