Arithmetic coding differential evolution with Tabu Search

Author

Watchanupaporn, Orawan ; Suwannik, Worasait ; Chongstitvatana, Prabhas

Author_Institution

Dept. of Comput. Sci., Kasetsart Univ., Sriracha, Thailand

fYear

2014

fDate

July 30 2014-Aug. 1 2014

Firstpage

174

Lastpage

179

Abstract

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.

Keywords

computational complexity; evolutionary computation; search problems; ACDE; Intel Core i7; O(n^1.92) polynomial class; O(n^2.10) polynomial class; O(n^2.45) polynomial class; arithmetic coding differential evolution; local search algorithm; optimum solution; population based binary optimization algorithm; tabu search; Computer science; Encoding; Optimization; Search problems; Sociology; Statistics; Vectors; binary optimization; local search; population based search;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Engineering Conference (ICSEC), 2014 International

Conference_Location

Khon Kaen

Print_ISBN

978-1-4799-4965-6

Type

conf

DOI

10.1109/ICSEC.2014.6978190

Filename

6978190