A Study of Roulette Wheel and Elite Selection on GA to Solve Job Shop Scheduling
Usage of Genetic algorithm to solve NP hard problems like job shop scheduling yields remarkable results. The choice of crossover and mutation parameters however effect the GA performance and still the selection off -springs plays a major role in tuning the GA performance and has remarkable significance in controlling early convergence or local convergence. In this paper we tried to study the results of roulette wheel and elite selection process on a linear chromosome structure.
KeywordsGenetic Algorithm Job Shop Scheduling Roulette wheel Elite Selection
Unable to display preview. Download preview PDF.
- 11.Lee, K.M., Yamakawa, T., Lee, K.M.: A genetic algorithm for general machine scheduling problems. International Journal of Knowledge-Based Electronic 2, 60–66 (1998)Google Scholar