A comparative analysis of genetic algorithms and QAP formulation for facility layout problem: An application in a real context

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper considers the problem of locating facilities in manufac-turing of electrical, telecommunications and building products. This is known as the Facility Layout Problem (FLP). This NP-hard problem has been largely studied in the scientific literature, and exact and approximate (heuristic and meta-heuristic) approaches have been used mainly to optimize one or more objectives. However, most of these studies do not consider real applications. Hence, in this work, we propose the use of Sule’s Method and genetic algo-rithms, for facility layout in a real industry application in Colombia so that the total cost to move the required material between the facilities is minimized. As far as we know, this is the first work in which Sule’s Method and genetic algorithms are used simultaneously for this combinatorial optimization problem. Computational experiments are carried out comparing the proposed approach versus QAP formulation. Additionally, the proposed approach was tested using well-known datasets from the literature in order to assure its efficiency.

Cite

CITATION STYLE

APA

Niebles, F., Escobar, I., Agudelo, L., & Jimenez, G. (2016). A comparative analysis of genetic algorithms and QAP formulation for facility layout problem: An application in a real context. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9713 LNCS, pp. 59–75). Springer Verlag. https://doi.org/10.1007/978-3-319-41009-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free