摘要
Single Row Facility Layout Problem (SRFLP) is a NP-Complete permutation problem which has been widely studied in the academic field in order to improve the efficiency on production site. The main purpose of SRFLP is to find an optimal permutation of a given number of rectangular facilities with minimum total cost by arranging them along a straight line. In this paper, we use the Simplified Swarm Optimization algorithm with an effective local search to find the near-optimal solution for SRFLP. The comparison of computational results of benchmark problems with previous studies shows that our proposed method has better efficiency and effectiveness in solving SRFLP. © 2017 IEEE.