A STUDY ON SOLVING THE FACILITY LAYOUT PROBLEM USING SIMULATED ANNEALING
Pawan Kumar S. S.1, Irappa Basappa Hunagund2, U.N. Kempaiah3
1PhD Scholar, Department of Mechanical Engineering, University Visvesvarayya College of Engineering, Bangalore- 560001, Karnataka, India.
2Professor, Department of Mechanical Engineering, Government Engineering College Haveri, Haveri – 581110, Karnataka, India.
3Professor, Department of Mechanical Engineering, University Visvesvarayya College of Engineering, Bangalore- 560001, Karnataka, India.
Abstract: This paper proposes a Simulated Annealing approach for solving equal-area facility layout problems. The technique employs a swap-based neighbourhood moves and Metropolis acceptance criteria to balance exploration and exploitation of the solution space. The algorithm was implemented in Python and evaluated on standard Quadratic Assignment Problem instances from QAPLIB, and its robustness was evaluated by solving the literature problem. Experimental results demonstrate that the proposed algorithm produced an optimal solution with minimal CPU time. Using a suitable Machine Learning concept, exploit the data of a large solution space and extract the minimum material handling cost.
Keywords: Simulated Annealing; facility layout; metaheuristic; QAP; Optimisation
VOLUME 10 ISSUE 01 2026: 263 – 279