Analyzing the Computing Time to Solve Single Row Facility Layout Problems by Simulated Annealing in a Python Framework

Abstract

The goal of this paper is to assess the Python computing time to solve a single row facility layout problem (SRFLP) by Simulated Annealing. The optimization problem is introduced, systematically modelled and then optimized numerically using a particular Python framework. The computing time and the results of experiments with various problem sizes and parameters are analyzed and discussed.