Show simple item record

dc.contributor.authorUlch, Daniel
dc.date.accessioned2018-08-16 18:31:37 (GMT)
dc.date.available2018-08-16 18:31:37 (GMT)
dc.date.issued2018-08-16
dc.date.submitted2018-08-15
dc.identifier.urihttp://hdl.handle.net/10012/13600
dc.description.abstractThe Facility Layout Problem (FLP) seeks to determine the dimensions, coordinates and arrangement of rectangular departments within a given facility. The goal is to minimize the cost of inter-department flow. It has several real-world applications, including the design of manufacturing and warehousing facilities and electronic chips. Despite being studied for several decades, the FLP is still very difficult to solve for facilities with thirty or more departments. Thus, many heuristic approaches have been developed to solve the problem in a reasonable time. One such approach tackles the problem in two stages. In the first, some decision, usually the relative positioning of the departments, is fixed. In the second, an easier restricted problem is solved. This thesis explores hierarchical and nesting approaches for the FLP in an attempt to leverage the fact that smaller instances of the FLP can be solved to optimality relatively quickly. The goal is to find ways in which the FLP can be decomposed into several smaller problems and recombined to form a high-quality solution to the original problem. Hierarchical approaches use clustering or related methods to generate a tree where the leaves are the original departments and the root is the facility. The intermediate nodes are super-departments within an overall layout. A new hierarchical approach for the FLP is presented which performs layouts down this tree in a manner that controls dead-space and generates high-quality solutions. The approach provides solutions competitive with the best-known solutions on benchmark instances from the literature, with up to 8% improvement. The success of the hierarchical approach provided the motivation for a new formulation that nests departments within super-departments. The resulting formulation is even more difficult to solve directly than the original FLP; however, it is suitable for a two-stage solution approach. The first stage determines the assignment of departments to super-departments and the relative positioning of the super-departments. In the second stage, the remainder of the formulation is solved. The approach is found to provide better solutions than the hierarchical approach. Solutions are found with up to 14% improvement over the best-known solutions from the literature.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectFacility Layouten
dc.subjectHierarchicalen
dc.subjectNestingen
dc.titleHierarchical and Nesting Approaches for the Facility Layout Problemen
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentManagement Sciencesen
uws-etd.degree.disciplineManagement Sciencesen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Applied Scienceen
uws.contributor.advisorElhedhli, Samir
uws.contributor.affiliation1Faculty of Engineeringen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages