optimal solution for VLSI circuit partitioning in physical design

              Circuits partitioning assumes a vital part in designing very large scale integration (VLSI) chips. Circuit partitioning is a critical step in the front end design. The interest in finding an optimal solution for partitioning in VLSI circuits has been a hot issue now days. In VLSI circuit partitioning, the issue of getting a minimum cut, less interconnects, low power, minimum delay and less area is included. The use of Evolutionary algorithms is increased to solve the above mentioned NP complete problems. This blog  investigates an overview of getting a minimum cut using, a Discrete Particle Swarm Optimization (DPSO) algorithm .        The DPSO algorithm proposed a new discrete position updating method of particles  and the operators of evolutionary algorithm for reference: the velocity is changed by mutation operator and influence of individual optimal solution and global optimal solution on particles by cros...