Imperialist competitive algorithm for solving single row facility layout problem

Single Row Facility Layout Problem (SRFLP) consists of arranging a number of rectangular facilities with varying length on one side of a straight line to minimize the weighted sum of the distance between all facility pairs. In this paper we use an Imperialist Competitive Algorithm (ICA) to solve the SRFLP. Computational results on benchmark problems show the efficiency of the proposed algorithm compared to other heuristics