Hybrid PSO – SA Algorithm for Achieving Partitioning Optimization in Various Network Applications

Abstract

In this paper we present partitioning for simultaneous cut size and circuit delay minimization. Due to the random search, of simulated annealing algorithms, the solution of a circuit partitioning problem is global optimum. [1] The circuit is divided into partitions and number of interconnections between them is minimized. [2] PSO employs a collaborative population-based search, which is inspired by the social behavior of bird flocking. It combines local search (by self experience) and global search (by neighboring experience), possessing high search efficiency. SA employs certain probability to avoid becoming trapped in a local optimum and the search process can be controlled by the cooling schedule. Experimental result shows that the developed hybrid PSO and SA algorithm can consistently produce the better result than the other algorithms.