Evolutionary algorithms, simulated annealing and tabu search: a comparative study

Evolutionary algorithms, simulated annealing and tabu search: a comparative study. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 14 (2): 167-181 APR 2001.


Download (394kB) | Preview


Abstract Evolutionary algorithms, simulated annealing (SA), and tabu search (TS) are general iterative algorithms for combinatorial optimization. The termevolutionary algorithmis used to refer to any probabilistic algorithmwhose design is inspired by evolutionary mechanisms found in biological species. Most widely known algorithms of this category are genetic algorithms (GA). GA, SA, and TS have been found to be very effective and robust in solving numerous problems from a wide range of application domains. Furthermore, they are even suitable for ill-posed problems where some of the parameters are not known before hand. These properties are lacking in all traditional optimization techniques. In this paper we perform a comparative study among GA, SA, and TS. These algorithms have many similarities, but they also possess distinctive features, mainly in their strategies for searching the solution state space. The three heuristics are applied on the same optimization problem and compared with respect to (1) quality of the best solution identified by each heuristic, (2) progress of the search frominitial solution(s) until stopping criteria are met, (3) the progress of the cost of the best solution as a function of time (iteration count), and (4) the number of solutions found at successive intervals of the cost function. The benchmark problem used is the floorplanning of very large scale integrated (VLSI) circuits. This is a hard multi-criteria optimization problem. Fuzzy logic is used to combine all objective criteria into a single fuzzy evaluation (cost) function, which is then used to rate competing solutions. # 2001 Elsevier Science Ltd. All rights reserved. Keywords: Genetic algorithms; Simulated annealing; Tabu search; Fuzzy logic; Floorplanning; Combinatorial optimization; VLSI

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AbdulRahman
Date Deposited: 09 Mar 2008 13:26
Last Modified: 01 Nov 2019 13:23
URI: http://eprints.kfupm.edu.sa/id/eprint/276