A particle swarm optimization for the single row facility layout problem

Authors:
Hamed Samarghandi;Pouria Taabayan;Farzad Firouzi Jahantigh
Affiliations:
Department of Mechanical Engineering, University of Manitoba, Winnipeg, Manitoba, Canada;Department of Management, Iran University of Science and Technology, Tehran, Iran;Department of Industrial Engineering, University of Sistan and Baluchestan, Zahedan, Iran
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 5
Cited 6

A heuristic procedure for the layout of a large number of facilities

Management Science
Machine layout problem in flexible manufacturing systems

Operations Research
An ant algorithm for the single row layout problem in flexible manufacturing systems

Computers and Operations Research
A new lower bound for the single row facility layout problem

Discrete Applied Mathematics
A semidefinite optimization approach for the single-row layout problem with unequal dimensions

Discrete Optimization

Insertion based Lin-Kernighan heuristic for single row facility layout

Computers and Operations Research
Multiobjective layout optimization of robotic cellular manufacturing systems

Computers and Industrial Engineering
Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem

Computers and Industrial Engineering
A parallel ordering problem in facilities layout

Computers and Operations Research
A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem

Computers & Mathematics with Applications
A scatter search algorithm for the single row facility layout problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 a Particle Swarm Optimization (PSO) algorithm to solve the SRFLP. We first employ a new coding and decoding technique to efficiently map discrete feasible space of the SRFLP to a continuous space. The proposed PSO will further use this coding technique to explore the continuous solution space. Afterwards, the algorithm decodes the solutions to its respective feasible solution in the discrete feasible space and returns the solutions. Computational results on benchmark problems show the efficiency of the proposed algorithm compared to other heuristics.