Applied in Assignment Problem Solving
journal of kerbala university,
2008, Volume 4, Issue 3, Pages 141-152
AbstractThis paper attempts to implement survival of fittest by several selection strategies to solve the assignment problems through genetic algorithm . The assignment problem is basically the “N men- N tasks” problem where a single job can be assigned to only one person in such a way that the overall cost of assignment is minimized . Diversity has been measured of each generation and analyzed for a number of popular selection algorithms(Rolette Well Selection , Random Selection,and Tournament Selection with 4,8 size).Partial Matched Crossover(PMX) with mutation have been used with experiment crossover probability Pc = 1 and mutation probability Pm = 0.5 .
- Article View: 168
- PDF Download: 117