利用可变邻域下降和遗传算法对制鞋行业混合模型装配系统进行排序

IF 3.7 4区 管理学 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Perspectives Pub Date : 2021-01-01 DOI:10.1016/j.orp.2021.100193
Parisa Sadeghi , Rui Diogo Rebelo , José Soeiro Ferreira
{"title":"利用可变邻域下降和遗传算法对制鞋行业混合模型装配系统进行排序","authors":"Parisa Sadeghi ,&nbsp;Rui Diogo Rebelo ,&nbsp;José Soeiro Ferreira","doi":"10.1016/j.orp.2021.100193","DOIUrl":null,"url":null,"abstract":"<div><p>This paper addresses a new Mixed-model Assembly Line Sequencing Problem in the Footwear industry. This problem emerges in a large company, which benefits from advanced automated stitching systems. However, these systems need to be managed and optimised. Operators with varied abilities operate machines of various types, placed throughout the stitching lines. In different quantities, the components of the various shoe models, placed in boxes, move along the lines in either direction. The work assumes that the associated balancing problems have already been solved, thus solely concentrating on the sequencing procedures to minimise the makespan.</p><p>An optimisation model is presented, but it has just been useful to structure the problems and test small instances due to the practical problems’ complexity and dimension. Consequently, two methods were developed, one based on Variable Neighbourhood Descent, named <em>VND-MSeq</em>, and the other based on Genetic Algorithms, referred to as <em>GA-MSeq</em>.</p><p>Computational results are included, referring to diverse instances and real large-size problems. These results allow for a comparison of the novel methods and to ascertain their effectiveness. We obtained better solutions than those available in the company.</p></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":null,"pages":null},"PeriodicalIF":3.7000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orp.2021.100193","citationCount":"5","resultStr":"{\"title\":\"Using variable neighbourhood descent and genetic algorithms for sequencing mixed-model assembly systems in the footwear industry\",\"authors\":\"Parisa Sadeghi ,&nbsp;Rui Diogo Rebelo ,&nbsp;José Soeiro Ferreira\",\"doi\":\"10.1016/j.orp.2021.100193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper addresses a new Mixed-model Assembly Line Sequencing Problem in the Footwear industry. This problem emerges in a large company, which benefits from advanced automated stitching systems. However, these systems need to be managed and optimised. Operators with varied abilities operate machines of various types, placed throughout the stitching lines. In different quantities, the components of the various shoe models, placed in boxes, move along the lines in either direction. The work assumes that the associated balancing problems have already been solved, thus solely concentrating on the sequencing procedures to minimise the makespan.</p><p>An optimisation model is presented, but it has just been useful to structure the problems and test small instances due to the practical problems’ complexity and dimension. Consequently, two methods were developed, one based on Variable Neighbourhood Descent, named <em>VND-MSeq</em>, and the other based on Genetic Algorithms, referred to as <em>GA-MSeq</em>.</p><p>Computational results are included, referring to diverse instances and real large-size problems. These results allow for a comparison of the novel methods and to ascertain their effectiveness. We obtained better solutions than those available in the company.</p></div>\",\"PeriodicalId\":38055,\"journal\":{\"name\":\"Operations Research Perspectives\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.orp.2021.100193\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Perspectives\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2214716021000154\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Perspectives","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214716021000154","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 5

摘要

本文研究了鞋类行业中一个新的混合模式装配线排序问题。这个问题出现在一家大公司,它受益于先进的自动拼接系统。然而,这些系统需要管理和优化。不同能力的操作员操作不同类型的机器,放置在整个缝合线上。放置在盒子里的各种鞋型号的部件,数量不同,沿着线条向两个方向移动。该工作假设相关的平衡问题已经解决,因此只关注排序程序以最小化完工时间。提出了一种优化模型,但由于实际问题的复杂性和维度,它只能用于问题的结构化和小实例的测试。因此,开发了两种方法,一种基于可变邻域下降,称为VND-MSeq,另一种基于遗传算法,称为GA-MSeq。计算结果,参考了不同的实例和实际的大型问题。这些结果允许对新方法进行比较,并确定其有效性。我们得到了比公司现有的更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Using variable neighbourhood descent and genetic algorithms for sequencing mixed-model assembly systems in the footwear industry

This paper addresses a new Mixed-model Assembly Line Sequencing Problem in the Footwear industry. This problem emerges in a large company, which benefits from advanced automated stitching systems. However, these systems need to be managed and optimised. Operators with varied abilities operate machines of various types, placed throughout the stitching lines. In different quantities, the components of the various shoe models, placed in boxes, move along the lines in either direction. The work assumes that the associated balancing problems have already been solved, thus solely concentrating on the sequencing procedures to minimise the makespan.

An optimisation model is presented, but it has just been useful to structure the problems and test small instances due to the practical problems’ complexity and dimension. Consequently, two methods were developed, one based on Variable Neighbourhood Descent, named VND-MSeq, and the other based on Genetic Algorithms, referred to as GA-MSeq.

Computational results are included, referring to diverse instances and real large-size problems. These results allow for a comparison of the novel methods and to ascertain their effectiveness. We obtained better solutions than those available in the company.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Operations Research Perspectives
Operations Research Perspectives Mathematics-Statistics and Probability
CiteScore
6.40
自引率
0.00%
发文量
36
审稿时长
27 days
期刊最新文献
A generalized behavioral-based goal programming approach for decision-making under imprecision δ-perturbation of bilevel optimization problems: An error bound analysis Competitive pricing and seed node selection in a two-echelon supply chain Strategizing emissions reduction investment for a livestock production farm amid power demand pattern: A path to sustainable growth under the carbon cap environmental regulation Do jumps matter in discrete-time portfolio optimization?
×
引用
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