We discuss 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. We consider the search for the best set as a second optimisation problem that we solve by a Genetic Algorithm. The performance of our approach is tested in the particular case of backtracking minimisation in a single row machine layout problem for flexible manufacturing systems.
Optimisation of a simulated-annealing-based heuristic for single row machine layout problem using genetic algorithm
BRAGLIA, MARCELLO
1996-01-01
Abstract
We discuss 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. We consider the search for the best set as a second optimisation problem that we solve by a Genetic Algorithm. The performance of our approach is tested in the particular case of backtracking minimisation in a single row machine layout problem for flexible manufacturing systems.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
