A New Hybrid Genetic Algorithm to Deal with the Flow Shop Scheduling Problem for Makespan Minimization

摘要

In the last years, many hybrid metaheuristics and heuristics combine one or more algorithmic ideas from different metaheuristics or even other techniques. This paper addresses the hybridization of a primitive ant colony algorithm inspired from the Pachycondyla apicalis behavior to search prey with the Genetic Algorithm to find near optimal solutions to solve the Flow Shop Scheduling Problem with makespan minimization. The developed algorithm is applied on different flow shop examples with diverse number of jobs. A sensitivity analysis was performed to define a good parameter choice for both the hybrid metaheuristic and the classical Genetic Algorithm. Computational results are given and show that the developed metaheuristic yields to a good quality solutions.