Hershey, Pennsylvania
New York, New YorkBeijing, China
Solution for Multi-Objective Single Row Facility Layout Problem Using PSO Algorithm

Solution for Multi-Objective Single Row Facility Layout Problem Using PSO Algorithm

Lenin Nagarajan (Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, India), Siva Kumar Mahalingam (Vel tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, India), Gurusamy Selvakumar (Sri Sivasubramaniya Nadar College of Engineering, India), and Jayakrishna Kandasamy (VIT University, India)
Copyright: © 2021 |Pages: 29
DOI: 10.4018/978-1-7998-7206-1.ch014
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

An optimized facility layout design helps to ensure a high level of machine usability along with minimum cost and good performance. However, facility layout is a multi-objective design optimization problem, and as such, it is difficult to solve. This original research work aims to design an optimal linear machine sequence using particle swarm optimization algorithm that minimizes the following: the total investment cost of machines, the total number of machines in the final sequence, the total flow time of the products, and the total flow distance of the products. The effectiveness of the proposed algorithm is demonstrated with a reasonable number of problems. Maximum of 19.1% reduction in total flow distance of products, 12.8% reduction in total investment cost of machines, 28.4% reduction in total flow time of products, and reduction of two numbers of machines in the layout are achieved by proposed method compared with the previous approaches.
Chapter Preview
Top

The theoretical attractiveness and practical applications of the single-row facility layout problem (SRFLP) have created a rich and growing literature in this field. This literature has proven the SRFLP to be a non-polynomial (NP) complete problem (Suresh G and Sahu S, 1993). As such, the application of precise methods to large instances of the problem is cumbersome and time-consuming; therefore, heuristic methods have been developed to obtain a near-optimal solution to the problem. Several researchers have applied these heuristic methods to formulate the linear sequencing of machines for the SRFLP.

Complete Chapter List

Search this Book:
Reset