Finding optimum facility’s layout by developed simulated annealing algorithm

Abstract

The Quadratic Assignment Problem (QAP) is one of the problems of combinatorial optimization belonging to the NP-hard problems’ class and has a wide application in the placement of facilities. Thus far, many efforts have been made to solve this problem and countless algorithms have been developed to achieve the optimal solutions; one of which is the Simulated Annealing (SA) algorithm. This paper aims at finding a suitable layout for the facilities of an industrial workshop by using a Developed Simulated Annealing (DSA) method.

Keywords

• simulated annealing
• meta-heuristic
• facility layout problem(flp)
• dsa method