装配线设计的新多目标优化算法

H. Chehade, F. Yalaoui, L. Amodeo
{"title":"装配线设计的新多目标优化算法","authors":"H. Chehade, F. Yalaoui, L. Amodeo","doi":"10.1504/IJAOM.2013.053532","DOIUrl":null,"url":null,"abstract":"Multiobjective optimisation methods for an assembly line design problem are presented in this paper. The studied problem consists of two parts. Among a set of candidate machines, the first part of the problem aims to assign a single machine to each workstation. The goal of the second part is to size the intermediate buffers. Two objectives are taken in consideration for our design problem: the minimisation of the cost of the line and the maximisation of the throughput rate. Different new multiobjective methods are developed to solve the problem. First, a multiobjective ant colony optimisation algorithm is proposed. Then, in order to get better results, the first algorithm is coupled with a guided local search. The third method proposed for the first time to solve our problem, called L-ant, is based on a multiobjective ant colony algorithm but using the Lorenz dominance. The fourth algorithm is another new method based on genetic algorithms and the Lorenz dominance and called Lorenz-archive. In order to compare the different methods to each others and to assess their efficiency, different measuring criteria are applied on the best fronts with the non-dominated solutions.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"New multiobjective optimisation algorithms for assembly lines design\",\"authors\":\"H. Chehade, F. Yalaoui, L. Amodeo\",\"doi\":\"10.1504/IJAOM.2013.053532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiobjective optimisation methods for an assembly line design problem are presented in this paper. The studied problem consists of two parts. Among a set of candidate machines, the first part of the problem aims to assign a single machine to each workstation. The goal of the second part is to size the intermediate buffers. Two objectives are taken in consideration for our design problem: the minimisation of the cost of the line and the maximisation of the throughput rate. Different new multiobjective methods are developed to solve the problem. First, a multiobjective ant colony optimisation algorithm is proposed. Then, in order to get better results, the first algorithm is coupled with a guided local search. The third method proposed for the first time to solve our problem, called L-ant, is based on a multiobjective ant colony algorithm but using the Lorenz dominance. The fourth algorithm is another new method based on genetic algorithms and the Lorenz dominance and called Lorenz-archive. In order to compare the different methods to each others and to assess their efficiency, different measuring criteria are applied on the best fronts with the non-dominated solutions.\",\"PeriodicalId\":191561,\"journal\":{\"name\":\"Int. J. Adv. Oper. Manag.\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Adv. Oper. Manag.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAOM.2013.053532\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Adv. Oper. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAOM.2013.053532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了装配线设计问题的多目标优化方法。所研究的问题由两部分组成。在一组候选机器中,问题的第一部分旨在为每个工作站分配一台机器。第二部分的目标是确定中间缓冲区的大小。我们的设计问题考虑了两个目标:生产线成本的最小化和吞吐率的最大化。为了解决这一问题,人们开发了各种新的多目标方法。首先,提出了一种多目标蚁群优化算法。然后,为了得到更好的结果,将第一种算法与引导局部搜索相结合。第一次提出的解决我们问题的第三种方法,称为L-ant,是基于多目标蚁群算法,但使用洛伦兹优势。第四种算法是另一种基于遗传算法和洛伦兹优势的新算法,称为洛伦兹存档。为了比较不同的方法并评估它们的效率,在具有非支配解的最佳前沿应用了不同的测量标准。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New multiobjective optimisation algorithms for assembly lines design
Multiobjective optimisation methods for an assembly line design problem are presented in this paper. The studied problem consists of two parts. Among a set of candidate machines, the first part of the problem aims to assign a single machine to each workstation. The goal of the second part is to size the intermediate buffers. Two objectives are taken in consideration for our design problem: the minimisation of the cost of the line and the maximisation of the throughput rate. Different new multiobjective methods are developed to solve the problem. First, a multiobjective ant colony optimisation algorithm is proposed. Then, in order to get better results, the first algorithm is coupled with a guided local search. The third method proposed for the first time to solve our problem, called L-ant, is based on a multiobjective ant colony algorithm but using the Lorenz dominance. The fourth algorithm is another new method based on genetic algorithms and the Lorenz dominance and called Lorenz-archive. In order to compare the different methods to each others and to assess their efficiency, different measuring criteria are applied on the best fronts with the non-dominated solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信