Title: Solution for bi-objective single row facility layout problem using artificial bee colony algorithm

Authors: Lenin Nagarajan; Siva Kumar Mahalingam; Selvakumar Gurusamy; Vignesh Kumar Dharmaraj

Addresses: Mechanical Engineering Department, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai, 600 062, Tamilnadu, India ' Mechanical Engineering Department, Sree Sowdambika College of Engineering, Aruppukottai, 626 134, Tamilnadu, India ' Mechanical Engineering Department, SSN Collge of Engineering, Chennai, 603 110, Tamilnadu, India ' Mechanical Engineering Department, National Engineering College, Kovilpatti, 628 503, Tamilnadu, India

Abstract: The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method. [Revise 21 September 2017; Received 27 November 2016; Accepted on 29 December 2017]

Keywords: single row facility layout problem; SRFLP; bi-objective; linear machine sequence; lms; artificial bee colony; ABC algorithm; total flow distance; total length of the flow line.

DOI: 10.1504/EJIE.2018.090619

European Journal of Industrial Engineering, 2018 Vol.12 No.2, pp.252 - 275

Available online: 14 Mar 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article