Optimisation of a Simulated-Annealing-based heuristic for single row machine layout problem by Generic Algorithm

This paper discusses a procedure to determine the optimal set of parameters relevant to heuristics based on the Simulated Annealing technique, an algorithm which is widely applied to combinatorial problems in the field of manufacturing systems. It considers the search for the best set as a second optimisation problem that is solved by a Genetic Algorithm. The performance of the approach is tested in the particular case of backtracking minimisation in a single row machine layout problem for flexible manufacturing systems.