Mathematical optimization approach for facility layout on several rows

Detalhes bibliográficos
Autor(a) principal: Anjos, Miguel F.
Data de Publicação: 2021
Outros Autores: Vieira, Manuel V. C.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10362/116884
Resumo: The facility layout problem is concerned with finding an arrangement of non-overlapping indivisible departments within a facility so as to minimize the total expected flow cost. In this paper we consider the special case of multi-row layout in which all the departments are to be placed in three or more rows, and our focus is on, for the first time, solutions for large instances. We first propose a new mixed integer linear programming formulation that uses continuous variables to represent the departments’ location in both x and y coordinates, where x represents the position of a department within a row and y represents the row assigned to the department. We prove that this formulation always achieves an optimal solution with integer values of y, but it is limited to solving instances with up to 13 departments. This limitation motivates the application of a two-stage optimization algorithm that combines two mathematical optimization models by taking the output of the first-stage model as the input of the second-stage model. This algorithm is, to the best of our knowledge, the first one in the literature reporting solutions for instances with up to 100 departments.
id RCAP_a56fbfb466d2d6c950b359c412c95559
oai_identifier_str oai:run.unl.pt:10362/116884
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Mathematical optimization approach for facility layout on several rowsContinuous optimizationFacilities planning and designMixed integer linear programmingRow layoutUnequal-areas facility layoutControl and OptimizationThe facility layout problem is concerned with finding an arrangement of non-overlapping indivisible departments within a facility so as to minimize the total expected flow cost. In this paper we consider the special case of multi-row layout in which all the departments are to be placed in three or more rows, and our focus is on, for the first time, solutions for large instances. We first propose a new mixed integer linear programming formulation that uses continuous variables to represent the departments’ location in both x and y coordinates, where x represents the position of a department within a row and y represents the row assigned to the department. We prove that this formulation always achieves an optimal solution with integer values of y, but it is limited to solving instances with up to 13 departments. This limitation motivates the application of a two-stage optimization algorithm that combines two mathematical optimization models by taking the output of the first-stage model as the input of the second-stage model. This algorithm is, to the best of our knowledge, the first one in the literature reporting solutions for instances with up to 100 departments.CMA - Centro de Matemática e AplicaçõesDM - Departamento de MatemáticaRUNAnjos, Miguel F.Vieira, Manuel V. C.2021-05-03T22:52:32Z2021-022021-02-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10362/116884eng1862-4472PURE: 19640854https://doi.org/10.1007/s11590-020-01621-zinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-03-11T04:59:44Zoai:run.unl.pt:10362/116884Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:43:20.840179Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Mathematical optimization approach for facility layout on several rows
title Mathematical optimization approach for facility layout on several rows
spellingShingle Mathematical optimization approach for facility layout on several rows
Anjos, Miguel F.
Continuous optimization
Facilities planning and design
Mixed integer linear programming
Row layout
Unequal-areas facility layout
Control and Optimization
title_short Mathematical optimization approach for facility layout on several rows
title_full Mathematical optimization approach for facility layout on several rows
title_fullStr Mathematical optimization approach for facility layout on several rows
title_full_unstemmed Mathematical optimization approach for facility layout on several rows
title_sort Mathematical optimization approach for facility layout on several rows
author Anjos, Miguel F.
author_facet Anjos, Miguel F.
Vieira, Manuel V. C.
author_role author
author2 Vieira, Manuel V. C.
author2_role author
dc.contributor.none.fl_str_mv CMA - Centro de Matemática e Aplicações
DM - Departamento de Matemática
RUN
dc.contributor.author.fl_str_mv Anjos, Miguel F.
Vieira, Manuel V. C.
dc.subject.por.fl_str_mv Continuous optimization
Facilities planning and design
Mixed integer linear programming
Row layout
Unequal-areas facility layout
Control and Optimization
topic Continuous optimization
Facilities planning and design
Mixed integer linear programming
Row layout
Unequal-areas facility layout
Control and Optimization
description The facility layout problem is concerned with finding an arrangement of non-overlapping indivisible departments within a facility so as to minimize the total expected flow cost. In this paper we consider the special case of multi-row layout in which all the departments are to be placed in three or more rows, and our focus is on, for the first time, solutions for large instances. We first propose a new mixed integer linear programming formulation that uses continuous variables to represent the departments’ location in both x and y coordinates, where x represents the position of a department within a row and y represents the row assigned to the department. We prove that this formulation always achieves an optimal solution with integer values of y, but it is limited to solving instances with up to 13 departments. This limitation motivates the application of a two-stage optimization algorithm that combines two mathematical optimization models by taking the output of the first-stage model as the input of the second-stage model. This algorithm is, to the best of our knowledge, the first one in the literature reporting solutions for instances with up to 100 departments.
publishDate 2021
dc.date.none.fl_str_mv 2021-05-03T22:52:32Z
2021-02
2021-02-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10362/116884
url http://hdl.handle.net/10362/116884
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1862-4472
PURE: 19640854
https://doi.org/10.1007/s11590-020-01621-z
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799138043306704896