Parisa Sadeghi , Rui Diogo Rebelo , José Soeiro Ferreira
{"title":"利用可变邻域下降和遗传算法对制鞋行业混合模型装配系统进行排序","authors":"Parisa Sadeghi , Rui Diogo Rebelo , 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 , Rui Diogo Rebelo , 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}
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.