New Matrix Methodology for Algorithmic Transparency in Assembly Line Balancing Using a Genetic Algorithm

IF 3.7 4区 管理学 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Juan Ignacio Anel , Pau Català , Moisès Serra , Bruno Domenech
{"title":"New Matrix Methodology for Algorithmic Transparency in Assembly Line Balancing Using a Genetic Algorithm","authors":"Juan Ignacio Anel ,&nbsp;Pau Català ,&nbsp;Moisès Serra ,&nbsp;Bruno Domenech","doi":"10.1016/j.orp.2022.100223","DOIUrl":null,"url":null,"abstract":"<div><p>This article focuses on the Mixed-Model Assembly Line Balancing single-target problem of type 2 with single-sided linear assembly line configurations, which is common in the industrial environment of small and medium-sized enterprises (SMEs). The main objective is to achieve Algorithmic Transparency (AT) when using Genetic Algorithms for the resolution of balancing operation times. This is done by means of a new matrix methodology that requires working with product functionalities instead of product references.</p><p>The achieved AT makes it easier for process engineers to interpret the obtained solutions using Genetic Algorithms and the factors that influence decisions made by algorithms, thereby helping in the later decision-making process. Additionally, through the proposed new matrix methodology, the computational cost is reduced with respect to the stand-alone use of Genetic Algorithms.</p><p>The AT produced using the new matrix methodology is validated through its application in an industry-based paradigmatic example.</p></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":null,"pages":null},"PeriodicalIF":3.7000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214716022000033/pdfft?md5=0203d3e8eba1d8d1d7b1476c3ec88b8e&pid=1-s2.0-S2214716022000033-main.pdf","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Perspectives","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214716022000033","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 2

Abstract

This article focuses on the Mixed-Model Assembly Line Balancing single-target problem of type 2 with single-sided linear assembly line configurations, which is common in the industrial environment of small and medium-sized enterprises (SMEs). The main objective is to achieve Algorithmic Transparency (AT) when using Genetic Algorithms for the resolution of balancing operation times. This is done by means of a new matrix methodology that requires working with product functionalities instead of product references.

The achieved AT makes it easier for process engineers to interpret the obtained solutions using Genetic Algorithms and the factors that influence decisions made by algorithms, thereby helping in the later decision-making process. Additionally, through the proposed new matrix methodology, the computational cost is reduced with respect to the stand-alone use of Genetic Algorithms.

The AT produced using the new matrix methodology is validated through its application in an industry-based paradigmatic example.

基于遗传算法的装配线平衡算法透明性新矩阵方法
本文主要研究了在中小企业工业环境中常见的具有单面线性装配线配置的2型混合模型装配线平衡单目标问题。主要目标是在使用遗传算法解决平衡操作时间时实现算法透明性(AT)。这是通过一种新的矩阵方法来实现的,这种方法需要处理产品功能而不是产品引用。实现的AT使过程工程师更容易使用遗传算法和影响算法做出决策的因素来解释获得的解决方案,从而有助于后期的决策过程。此外,通过提出新的矩阵方法,相对于单独使用遗传算法,计算成本降低。使用新矩阵方法产生的AT通过其在基于行业的范例中的应用得到验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research Perspectives
Operations Research Perspectives Mathematics-Statistics and Probability
CiteScore
6.40
自引率
0.00%
发文量
36
审稿时长
27 days
×
引用
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学术官方微信