Open AccessSIMULATION OF PSO BASED APPROACH FOR CMOL CELL ASSIGNMENT PROBLEM
Author(s) -
PrateekSaurabh Shrivastava,
Khemraj Deshmukh
Publication year - 2015
Publication title -
international journal of research - granthaalayah
Language(s) - English
Resource type - Journals
eISSN - 2394-3629
pISSN - 2350-0530
DOI - 10.29121/granthaalayah.v3.i5.2015.3009
Subject(s) - crossover , particle swarm optimization , genetic algorithm , mathematical optimization , computer science , mutation , local optimum , meta optimization , swarm behaviour , multi swarm optimization , block (permutation group theory) , algorithm , mathematics , artificial intelligence , gene , biology , genetics , geometry
Particle swarm optimization (PSO) approach is used over genetic algorithms (GAS) to solve many of the same kinds of problems. This optimization technique does not suffer, however, from some of GA’s difficulties; interaction in the group enhances rather than detracts from progress toward the solution. Further, a particle swarm system has memory, which the genetic algorithm does not have. In particle swarm optimization, individuals who fly past optima are tugged to return toward them; knowledge of good solutions is retained by all particles. The genetic algorithm works with the concept of chromosomes having gene where each gene act as a block of one solution. This is totally based on the solution which is followed by crossover and then mutation and finally reaches to fitness. The best fitness will be considered as a result and implemented in the practical area. Due to some drawbacks and problems exist in the genetic algorithm implemented, scientists moved to the other algorithm technique which is apparently based on the flock of birds moving to the target. This effectively overcome the shortcomings of GA and provides better fitness solutions to implement in the circuit.