Single row facility layout problem using a permutation‐based genetic algorithm

Single row facility layout problem using a permutation‐based genetic algorithm

0.00 Avg rating0 Votes
Article ID: iaor20115420
Volume: 213
Issue: 2
Start Page Number: 388
End Page Number: 394
Publication Date: Sep 2011
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics: genetic algorithms
Abstract:

In this paper, a permutation‐based genetic algorithm (GA) is applied to the NP‐hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule‐based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large‐size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions.

Reviews

Required fields are marked *. Your email address will not be published.