By Topic

A Particle Swarm Optimization for the Single Row Facility Layout Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hamed Samarghandi ; University of Manitoba, Winnipeg, Canada ; Pouria Taabayan ; Farzad Firouzi Jahantigh

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.

Published in:

Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on

Date of Conference:

9-11 Dec. 2009