A Mixed Integer Linear Programming approach for a new form of facility layout problem

Yipei Zhang, A. Che
{"title":"A Mixed Integer Linear Programming approach for a new form of facility layout problem","authors":"Yipei Zhang, A. Che","doi":"10.1109/CoDIT.2014.6996869","DOIUrl":null,"url":null,"abstract":"This paper aims to study a new form of facility layout problem, in which the building has already been constructed and the specific room layout inside has been determined. Unlike the traditional facility layout problem, what we take into account is how to assign a certain number of rooms to a given number of departments with the purpose of maximizing the utilization rate of the rooms. This is equivalent to minimizing the total difference value between the extra area of different departments after satisfying their required area, thus reducing the space waste. To solve this special combinatorial optimization problem, we develop a Mixed-Integer Linear Programming (MILP) model. The model is solved using commercial software CPLEX12.6. Computational results on several randomly generated instances demonstrate the effectiveness of the proposed approach.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoDIT.2014.6996869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper aims to study a new form of facility layout problem, in which the building has already been constructed and the specific room layout inside has been determined. Unlike the traditional facility layout problem, what we take into account is how to assign a certain number of rooms to a given number of departments with the purpose of maximizing the utilization rate of the rooms. This is equivalent to minimizing the total difference value between the extra area of different departments after satisfying their required area, thus reducing the space waste. To solve this special combinatorial optimization problem, we develop a Mixed-Integer Linear Programming (MILP) model. The model is solved using commercial software CPLEX12.6. Computational results on several randomly generated instances demonstrate the effectiveness of the proposed approach.
一种新型设施布局问题的混合整数线性规划方法
本文研究的是一种新型的设施布置问题,即建筑物已经建成,内部的具体房间布置已经确定。与传统的设施布局问题不同,我们考虑的是如何将一定数量的房间分配给给定数量的部门,以使房间的利用率最大化。这相当于在满足各部门所需面积后,尽量减少各部门多余面积的总差值,从而减少空间浪费。为了解决这一特殊的组合优化问题,我们建立了一个混合整数线性规划(MILP)模型。利用商业软件CPLEX12.6对模型进行求解。在几个随机生成的实例上的计算结果证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信