Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm

DOI10.1111/j.1475-3995.1996.tb00034.xzbMath0863.90073OpenAlexW4255487269MaRDI QIDQ5690288

Marcello Braglia

Publication date: 10 June 1997

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1996.tb00034.x

zbMATH Keywords

heuristicsflexible manufacturing systemssimulated annealinggenetic algorithmsingle row machine layout

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Production models (90B30) Combinatorial optimization (90C27)

Related Items

Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Single row layout models ⋮ An efficient tabu algorithm for the single row facility layout problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Simulated annealing for machine layout problems in the presence of zoning constraints
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Minimizing flow time variance in a single machine system using genetic algorithms