Hybridizing tabu search with mathematical programming for solving a single row layout problem

Meng Yu, X. Zuo, Xinchao Zhao, Chunlu Wang
{"title":"Hybridizing tabu search with mathematical programming for solving a single row layout problem","authors":"Meng Yu, X. Zuo, Xinchao Zhao, Chunlu Wang","doi":"10.1109/COASE.2018.8560503","DOIUrl":null,"url":null,"abstract":"Single row layout problem is widely implemented in manufacturing systems. In this paper, we study a single row layout problem with consideration of additional clearances between adjacent facilities. The additional clearance is used to store work in process and allow technician access to the side of the facility and may be shared by any two adjacent facilities. A hybrid solution approach that integrates a tabu search with a mathematical programming is proposed to address it. The purpose of tabu search is to optimize the sequence of facilities and mathematical programming is used to find the optimal additional clearances. The hybrid approach is applied to a number of problem instances involving a range of facilities. Experimental results show that the hybrid approach can find the optimal solutions for most of small-size problem instances and good quality solutions for large-size problem instances.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"27 1","pages":"974-980"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2018.8560503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Single row layout problem is widely implemented in manufacturing systems. In this paper, we study a single row layout problem with consideration of additional clearances between adjacent facilities. The additional clearance is used to store work in process and allow technician access to the side of the facility and may be shared by any two adjacent facilities. A hybrid solution approach that integrates a tabu search with a mathematical programming is proposed to address it. The purpose of tabu search is to optimize the sequence of facilities and mathematical programming is used to find the optimal additional clearances. The hybrid approach is applied to a number of problem instances involving a range of facilities. Experimental results show that the hybrid approach can find the optimal solutions for most of small-size problem instances and good quality solutions for large-size problem instances.
混合禁忌搜索与数学规划求解单行布局问题
单行布局问题在制造系统中应用广泛。在本文中,我们研究了考虑相邻设施之间额外间隙的单排布局问题。额外的间隙用于储存正在进行的工作,并允许技术人员进入设施的一侧,并且可以由任何两个相邻的设施共享。提出了一种将禁忌搜索与数学规划相结合的混合求解方法。禁忌搜索的目的是优化设施的顺序,并使用数学规划来找到最优的附加间隙。混合方法适用于涉及一系列设施的许多问题实例。实验结果表明,该方法对大多数小问题实例能找到最优解,对大问题实例能找到质量较好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信