CAJ | 학술논문

针对蛋白质折叠问题的二维格点模型(2DHP)提出了一种改进的蚁群算法(ACO).受链生长型算法Pruned-Enriched Rosenbluth Mvthod(PERM)的启发,在计算迹的时候增加了一个新的信息量,使得改进后的蚁群算法具有较快的收敛速度,同时采用基于极值动力学的优化方法(EO)进行局部搜索.求解基准实例的结果表明,该算法能够在保证解质量的前提下能大大缩短计算时间.
침대단백질절첩문제적이유격점모형(2DHP)제출료일충개진적의군산법(ACO).수련생장형산법Pruned-Enriched Rosenbluth Mvthod(PERM)적계발,재계산적적시후증가료일개신적신식량,사득개진후적의군산법구유교쾌적수렴속도,동시채용기우겁치동역학적우화방법(EO)진행국부수색.구해기준실례적결과표명,해산법능구재보증해질량적전제하능대대축단계산시간.
An improved ant colony optimization algorithm for the 2D HP protein folding is presented.Inspired by pruned-enriched rosenbluth method (PERM),an additional pheromone is applied to direct ants' action.Furthermore,extremal optimization (EO) is used as a local search.We demonstrate that this improved ACO can be applied successfully to the protein folding problem.The results show that the algorithm can find these best solutions so far for the listed benchmarks.Within the achieved results,the search converged rapidly and efficiently.