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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/11/306 |
_version_ | 1797511563710562304 |
---|---|
author | Alan McKendall Artak Hakobyan |
author_facet | Alan McKendall Artak Hakobyan |
author_sort | Alan McKendall |
collection | DOAJ |
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. |
first_indexed | 2024-03-10T05:47:01Z |
format | Article |
id | doaj.art-585ffa4d21914175a272a682ad21bc79 |
institution | Directory Open Access Journal |
issn | 1999-4893 |
language | English |
last_indexed | 2024-03-10T05:47:01Z |
publishDate | 2021-10-01 |
publisher | MDPI AG |
record_format | Article |
series | Algorithms |
spelling | doaj.art-585ffa4d21914175a272a682ad21bc792023-11-22T22:04:36ZengMDPI AGAlgorithms1999-48932021-10-01141130610.3390/a14110306An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape FacilitiesAlan McKendall0Artak Hakobyan1Department of Industrial & Management Systems Engineering, West Virginia University, 321 Engineering Sciences Building, Morgantown, WV 26506, USADepartment of Industrial & Management Systems Engineering, West Virginia University, 321 Engineering Sciences Building, Morgantown, WV 26506, USAThe 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.https://www.mdpi.com/1999-4893/14/11/306unequal area facility layout problemfixed dimension facilitiesgenetic algorithmboundary search |
spellingShingle | Alan McKendall Artak Hakobyan An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities Algorithms unequal area facility layout problem fixed dimension facilities genetic algorithm boundary search |
title | 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_short | 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 |
topic | unequal area facility layout problem fixed dimension facilities genetic algorithm boundary search |
url | https://www.mdpi.com/1999-4893/14/11/306 |
work_keys_str_mv | AT alanmckendall anapplicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities AT artakhakobyan anapplicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities AT alanmckendall applicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities AT artakhakobyan applicationofanunequalareafacilitieslayoutproblemwithfixedshapefacilities |