An Improved Genetic-Simulated Annealing Algorithm Based on a Hormone Modulation Mechanism for a Flexible Flow-Shop Scheduling Problem

Abstract EN

A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational problem.

Since the problem is known to be strongly NP-hard, optimization can either be the subject of optimization approaches or be implemented for some approximated cases.

In this paper, an improved genetic-simulated annealing algorithm (IGAA), which combines genetic algorithm (GA) based on an encoding matrix with simulated annealing algorithm (SAA) based on a hormone modulation mechanism, is proposed to achieve the optimal or near-optimal solution.

The novel hybrid algorithm tries to overcome the local optimum and further to explore the solution space.

To evaluate the performance of IGAA, computational experiments are conducted and compared with results generated by different algorithms.

Experimental results clearly demonstrate that the improved metaheuristic algorithm performs considerably well in terms of solution quality, and it outperforms several other algorithms.