-DNA (Deoxyribonucleic Acid) Fragment Assembly (DFA) is one of combinatorial optimization popular which is often solved by evolutionary algorithms including ant colony optimization (ACO). Although showing the good performance, the ACO has a general model which has a repeat computation before achieving the convergence of result or solution. It also happens when ACO algorithms used to solve DFA problem. It has a tremendous number of computations and most of them are identified as redundant process. This research aims to make efficient method of ACO algorithm by eliminating the redundant process in solving DFA problem. The strategy consists two steps. First, finding the pattern of redundant process and second, compress it to one simple process. The proposed algorithms is implemented to solve five datasets of DFA problem. All of the results shows that the proposed algorithm can be faster with the competitive result comparing the original algorithm.

ant colony optimization, DFA Problem, redundant process, faster algorithm.

• Prof. Abba Suganda Girsang, S.T., M.Cs., Ph.D.

• Diana, S.Kom., M.T.I.