基于元启发式的有容量拆解批量问题优化

M. Godichaud, L. Amodeo, M. Hrouga
{"title":"基于元启发式的有容量拆解批量问题优化","authors":"M. Godichaud, L. Amodeo, M. Hrouga","doi":"10.1109/IESM.2015.7380324","DOIUrl":null,"url":null,"abstract":"Disassembly operations are required for most of manufactured products at the end of their life cycle. As economic activities and environmental pressures increase, the volume of product reverse flows are more and more important and costly. In this context, we propose an optimization method to minimize cost in disassembly planning with lot sizing and lost sales. Comparing to others lot sizing problems with lost sales, this problem has some specificities that required original optimization methods. To this end, we proposed a metaheuristic based on genetic algorithm scheme that integrates some neighborhoods dedicated to this problem. The quality of the solutions is compared with those obtained from a mathematical programming solver for small instances and different configurations of the algorithm are compared. The metaheuristic allows finding good solutions in a reasonable computational time for this tactical problem for all instance sizes.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Metaheuristic based optimization for capacitated disassembly lot sizing problem with lost sales\",\"authors\":\"M. Godichaud, L. Amodeo, M. Hrouga\",\"doi\":\"10.1109/IESM.2015.7380324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Disassembly operations are required for most of manufactured products at the end of their life cycle. As economic activities and environmental pressures increase, the volume of product reverse flows are more and more important and costly. In this context, we propose an optimization method to minimize cost in disassembly planning with lot sizing and lost sales. Comparing to others lot sizing problems with lost sales, this problem has some specificities that required original optimization methods. To this end, we proposed a metaheuristic based on genetic algorithm scheme that integrates some neighborhoods dedicated to this problem. The quality of the solutions is compared with those obtained from a mathematical programming solver for small instances and different configurations of the algorithm are compared. The metaheuristic allows finding good solutions in a reasonable computational time for this tactical problem for all instance sizes.\",\"PeriodicalId\":308675,\"journal\":{\"name\":\"2015 International Conference on Industrial Engineering and Systems Management (IESM)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Industrial Engineering and Systems Management (IESM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IESM.2015.7380324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IESM.2015.7380324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

大多数制造产品在其生命周期结束时都需要拆卸操作。随着经济活动和环境压力的增加,产品逆向流量越来越重要,成本也越来越高。在这种情况下,我们提出了一个优化方法,以最小化成本的拆卸计划与批量和销售损失。与其他有销售损失的批量问题相比,这个问题有一些特殊性,需要使用原始的优化方法。为此,我们提出了一种基于遗传算法的元启发式方案,该方案集成了一些专门用于该问题的邻域。将该算法的解质量与小实例数学规划求解器的解质量进行了比较,并对算法的不同配置进行了比较。元启发式允许在合理的计算时间内为所有实例大小的战术问题找到良好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Metaheuristic based optimization for capacitated disassembly lot sizing problem with lost sales
Disassembly operations are required for most of manufactured products at the end of their life cycle. As economic activities and environmental pressures increase, the volume of product reverse flows are more and more important and costly. In this context, we propose an optimization method to minimize cost in disassembly planning with lot sizing and lost sales. Comparing to others lot sizing problems with lost sales, this problem has some specificities that required original optimization methods. To this end, we proposed a metaheuristic based on genetic algorithm scheme that integrates some neighborhoods dedicated to this problem. The quality of the solutions is compared with those obtained from a mathematical programming solver for small instances and different configurations of the algorithm are compared. The metaheuristic allows finding good solutions in a reasonable computational time for this tactical problem for all instance sizes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信