z-logo
Premium
Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
Author(s) -
Braglia M.
Publication year - 1996
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.1996.tb00034.x
Subject(s) - backtracking , simulated annealing , heuristics , computer science , mathematical optimization , genetic algorithm , algorithm , adaptive simulated annealing , combinatorial search , combinatorial optimization , single machine scheduling , heuristic , set (abstract data type) , search algorithm , mathematics , job shop scheduling , artificial intelligence , machine learning , beam search , schedule , programming language , operating system
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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here