Convalesce Optimization for Input Allocation Problem Using Hybrid Genetic Algorithm
Mamta Madan and Sushila Madan
DOI : 10.3844/jcssp.2010.413.416
Journal of Computer Science
Volume 6, Issue 4
Problem statement: The purpose of this study was to describe categories of hybrid genetic algorithm and validate that the hybrid genetic algorithm converges to the optimal solution rather than a near optimal solution so that Hybrid Genetic algorithms can be used to solve real world problems and receive significant interest. Approach: We implemented the input allocation problem for a manufacturing unit firstly with pure genetic algorithm using Matlab's GA tool and then compared the results with hybrid genetic algorithm. Results: We observed that the results from applying only pure genetic algorithm to the problem were near optimal whereas when solved using hybrid genetic algorithm the results were significantly better and were optimal. Conclusion: The results presented by pure genetic algorithm and hybrid genetic algorithm are significant and validate that the hybrid genetic algorithm converges to the optimal solution rather than a near optimal solution.
© 2010 Mamta Madan and Sushila Madan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.