Convalesce Optimization for Input Allocation Problem Using Hybrid Genetic Algorithm
A.
Abstract
Open-access reader
A.
Abstract
Open-access reader
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.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Genetic algorithm, Computer science, Population-based incremental learning, Meta-optimization, Problem statement, Hybrid algorithm (constraint satisfaction), Mathematical optimization, Algorithm