A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem

Abstract

In the last years, a set of bio-inspired metaheuristics has proved their efficiencies in combinational and continues optimization areas. This paper intends to hybrid a discrete version of Bat Algorithm (BA) with Generalized Evolutionary Walk Algorithm (GEWA) to solve the mono-processors two stages Hybrid Flow Shop scheduling. The authors compare the modified bat algorithm with the original one, with Particle Swarm Optimization (PSO) and with others results taken from literature. Computational results on a standard two-stage hybrid flow shop benchmark of 70 cases, and about 1700 instances, indicate that the proposed algorithm finds the best makespan (Cmax) in a good processing time comparing to the original bat algorithm and other algorithms.