摘要
为了拓宽智能优化算法解决实际问题的能力,提出一种离散的细菌菌落优化算法。首先,设计新的个体编码方式以及进化方式;其次,融合禁忌搜素算法,克服算法易陷入早熟的不足;最后,与其它算法在Taillard标准调度测试问题集上比较实验,验证了算法的有效性。仿真表明,算法能够寻求到问题的最优组合。
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 shows that the new algorithm can search to their optimal combination.
出处
《软件导刊》
2013年第12期52-54,共3页
Software Guide
基金
国家自然科学基金项目(31100424)
云南省自然科学基金项目(2009CD070)
云南省教育厅科学研究基金项目(2012J047)
关键词
智能优化
离散优化算法
细菌菌落
禁忌搜索
Intelligence Algorithm
Discrete Optimization Algorithm
Bacterial Colony
Tabu Search
