Arithmetic coding differential evolution with Tabu Search

This paper combines Arithmetic Coding Differential Evolution (ACDE) with Tabu Search. ACDE is a population based binary optimization algorithm. Tabu Search is a local search algorithm. The proposed algorithm can solve very difficult problems reliably and quickly. From the experiment, it can always find an optimum solution for 120-bit Trap, 256-bit HIFF, and 243-bit hTrap in 23, 369, and 60 milliseconds respectively on Intel Core i7. The number of evaluation, assumed being in a polynomial class, is about O(n^2.10), O(n^2.45), and O(n^1.92), where n is a problem size.