Mixed-integer Programming Formulation for Constrained Double-row Layout Problem

Silu Liu, Xinjun He, Chao Guan, Juhua Gong, Zeqiang Zhang
{"title":"Mixed-integer Programming Formulation for Constrained Double-row Layout Problem","authors":"Silu Liu, Xinjun He, Chao Guan, Juhua Gong, Zeqiang Zhang","doi":"10.1145/3463858.3463861","DOIUrl":null,"url":null,"abstract":"The double-row layout problem (DRLP) is a well-known optimization problem that generally deals with the arrangement of machines or other such entities on the two sides along a corridor. Based on the placement of the machinery and equipment in a factory, this study analyzes the DRLP from a new perspective that addresses the arrangement of the given machines subject to the condition that certain designated positions are allocated to certain machines and specific relationships are enforced among the machines. This DRLP is termed as a constrained DRLP (cDRLP). In this study, considering the practical applications, four variations of the cDRLP have been developed for the first time and solved. Additionally, to solve this problem, some constraints (positioning, ordering, and relation constraints) have been defined and classified. Furthermore, mathematical models have been built with the objective of minimizing the total material handling cost. Next, the CPLEX software has been adopted to solve the above variations. Finally, a series of numerical instances have been employed to evaluate the efficiency of the proposed models and obtain the exact results.","PeriodicalId":317727,"journal":{"name":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","volume":"491 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3463858.3463861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The double-row layout problem (DRLP) is a well-known optimization problem that generally deals with the arrangement of machines or other such entities on the two sides along a corridor. Based on the placement of the machinery and equipment in a factory, this study analyzes the DRLP from a new perspective that addresses the arrangement of the given machines subject to the condition that certain designated positions are allocated to certain machines and specific relationships are enforced among the machines. This DRLP is termed as a constrained DRLP (cDRLP). In this study, considering the practical applications, four variations of the cDRLP have been developed for the first time and solved. Additionally, to solve this problem, some constraints (positioning, ordering, and relation constraints) have been defined and classified. Furthermore, mathematical models have been built with the objective of minimizing the total material handling cost. Next, the CPLEX software has been adopted to solve the above variations. Finally, a series of numerical instances have been employed to evaluate the efficiency of the proposed models and obtain the exact results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
约束双行布局问题的混合整数规划公式
双排布局问题(DRLP)是一个众所周知的优化问题,通常处理沿走廊两侧的机器或其他此类实体的排列。本研究以工厂内机器设备的布置为基础,从一个新的角度分析了DRLP问题,即在特定的位置分配给特定的机器,并在机器之间强制执行特定的关系的情况下,对给定机器的布置进行了分析。这种DRLP称为约束DRLP (cDRLP)。在本研究中,考虑到实际应用,首次开发并解决了cDRLP的四种变体。此外,为了解决这个问题,还定义和分类了一些约束(定位、排序和关系约束)。在此基础上,建立了以物料搬运总成本最小为目标的数学模型。接下来,采用CPLEX软件对上述变化进行求解。最后,通过一系列数值算例对所提模型的有效性进行了评价,得到了准确的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
3-opt Metaheuristics for the Probabilistic Orienteering Problem A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem A Binary Integer Programming Formulation and Solution for Truck Appointment Scheduling and Reducing Truck Turnaround Time in Container Terminals Reinforcement Learning and Additional Rewards for the Traveling Salesman Problem Machine Learning Approaches for the Traveling Salesman Problem: A Survey
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1