An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities

The unequal-area facility layout problem (UA-FLP) is the problem of locating rectangular facilities on a rectangular floor space such that facilities do not overlap while optimizing some objective. The objective considered in this paper is minimizing the total distance materials travel between facil...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Alan McKendall, Artak Hakobyan
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	unequal area facility layout problem fixed dimension facilities genetic algorithm boundary search Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/585ffa4d21914175a272a682ad21bc79
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:585ffa4d21914175a272a682ad21bc79
record_format	dspace
spelling	oai:doaj.org-article:585ffa4d21914175a272a682ad21bc792021-11-25T16:12:54ZAn Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities10.3390/a141103061999-4893https://doaj.org/article/585ffa4d21914175a272a682ad21bc792021-10-01T00:00:00Zhttps://www.mdpi.com/1999-4893/14/11/306https://doaj.org/toc/1999-4893The unequal-area facility layout problem (UA-FLP) is the problem of locating rectangular facilities on a rectangular floor space such that facilities do not overlap while optimizing some objective. The objective considered in this paper is minimizing the total distance materials travel between facilities. The UA-FLP considered in this paper considers facilities with fixed dimension and was motivated by the investigation of layout options for a production area at the Toyota Motor Manufacturing West Virginia (TMMWV) plant in Buffalo, WV, USA. This paper presents a mathematical model and a genetic algorithm for locating facilities on a continuous plant floor. More specifically, a genetic algorithm, which consists of a boundary search heuristic (BSH), a linear program, and a dual simplex method, is developed for an UA-FLP. To test the performance of the proposed technique, several test problems taken from the literature are used in the analysis. The results show that the proposed heuristic performs well with respect to solution quality and computational time.Alan McKendallArtak HakobyanMDPI AGarticleunequal area facility layout problemfixed dimension facilitiesgenetic algorithmboundary searchIndustrial engineering. Management engineeringT55.4-60.8Electronic computers. Computer scienceQA75.5-76.95ENAlgorithms, Vol 14, Iss 306, p 306 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	unequal area facility layout problem fixed dimension facilities genetic algorithm boundary search Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
spellingShingle	unequal area facility layout problem fixed dimension facilities genetic algorithm boundary search Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95 Alan McKendall Artak Hakobyan An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
description	The unequal-area facility layout problem (UA-FLP) is the problem of locating rectangular facilities on a rectangular floor space such that facilities do not overlap while optimizing some objective. The objective considered in this paper is minimizing the total distance materials travel between facilities. The UA-FLP considered in this paper considers facilities with fixed dimension and was motivated by the investigation of layout options for a production area at the Toyota Motor Manufacturing West Virginia (TMMWV) plant in Buffalo, WV, USA. This paper presents a mathematical model and a genetic algorithm for locating facilities on a continuous plant floor. More specifically, a genetic algorithm, which consists of a boundary search heuristic (BSH), a linear program, and a dual simplex method, is developed for an UA-FLP. To test the performance of the proposed technique, several test problems taken from the literature are used in the analysis. The results show that the proposed heuristic performs well with respect to solution quality and computational time.
format	article
author	Alan McKendall Artak Hakobyan
author_facet	Alan McKendall Artak Hakobyan
author_sort	Alan McKendall
title	An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
title_short	An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
title_full	An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
title_fullStr	An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
title_full_unstemmed	An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
title_sort	application of an unequal-area facilities layout problem with fixed-shape facilities
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/585ffa4d21914175a272a682ad21bc79
work_keys_str_mv	AT alanmckendall anapplicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities AT artakhakobyan anapplicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities AT alanmckendall applicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities AT artakhakobyan applicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities
_version_	1718413256996945920

An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities

Ejemplares similares