Abstract
Hybrid Genetic Algorithm-Simulated Annealing algorithm (HGASA) is proposed for explaining the permutation flow shop scheduling issue (PFSP) with minimizing makespan foundation. We have displayed a hybrid algorithm (HGASA) consolidates the great component of both the Genetic Algorithm and the simulated annealing algorithm. The HGASA is tried with outsized flow shop scheduling bench mark problems from OR Library and the test results are compared with earlier reported results of particle swarm optimization (PSO) algorithm, and a well-known bacterial foraging optimization algorithm (BFO). Almost, 45 famous benchmark problems were utilized to check the execution of proposed HGASA. The test comes about demonstrate that HGASA performs well with the other algorithm for all cases from the literature. The complexity of the proposed HGASA is found to be better than that of PSO and BFO. The obtained results demonstrates the viability of proposed HGASA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Asian Journal of Research in Social Sciences and Humanities
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
