A matheuristic approach combining genetic algorithm and mixed integer linear programming model for production and distribution planning in the supply chain

E. Guzman, R. Poler, B. Andrés
{"title":"A matheuristic approach combining genetic algorithm and mixed integer linear programming model for production and distribution planning in the supply chain","authors":"E. Guzman, R. Poler, B. Andrés","doi":"10.14743/apem2023.1.454","DOIUrl":null,"url":null,"abstract":"A number of research studies have addressed supply chain planning from various perspectives (strategical, tactical, operational) and demonstrated the advantages of integrating both production and distribution planning (PDP). The globalisation of supply chains and the fourth industrial revolution (Industry 4.0) mean that companies must be more agile and resilient to adapt to volatile demand, and to improve their relation with customers and suppliers. Hence the growing interest in coordinating production-distribution processes in supply chains. To deal with the new market’s requirements and to adapt business processes to industry’s regulations and changing conditions, more efforts should be made towards new methods that optimise PDP processes. This paper proposes a matheuristic approach for solving the PDP problem. Given the complexity of this problem, combining a genetic algorithm and a mixed integer linear programming model is proposed. The matheuristic algorithm was tested using the Coin-OR Branch & Cut open-source solver. The computational outcomes revealed that the presented matheuristic algorithm may be used to solve real sized problems.","PeriodicalId":445710,"journal":{"name":"Advances in Production Engineering & Management","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Production Engineering & Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14743/apem2023.1.454","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A number of research studies have addressed supply chain planning from various perspectives (strategical, tactical, operational) and demonstrated the advantages of integrating both production and distribution planning (PDP). The globalisation of supply chains and the fourth industrial revolution (Industry 4.0) mean that companies must be more agile and resilient to adapt to volatile demand, and to improve their relation with customers and suppliers. Hence the growing interest in coordinating production-distribution processes in supply chains. To deal with the new market’s requirements and to adapt business processes to industry’s regulations and changing conditions, more efforts should be made towards new methods that optimise PDP processes. This paper proposes a matheuristic approach for solving the PDP problem. Given the complexity of this problem, combining a genetic algorithm and a mixed integer linear programming model is proposed. The matheuristic algorithm was tested using the Coin-OR Branch & Cut open-source solver. The computational outcomes revealed that the presented matheuristic algorithm may be used to solve real sized problems.
一种结合遗传算法和混合整数线性规划模型的供应链生产分配规划数学方法
许多研究已经从不同的角度(战略,战术,操作)解决了供应链规划,并展示了整合生产和分销计划(PDP)的优势。供应链的全球化和第四次工业革命(工业4.0)意味着企业必须更加灵活和有弹性,以适应不稳定的需求,并改善与客户和供应商的关系。因此,人们对协调供应链中的生产-分配过程越来越感兴趣。为了应对新的市场需求,并使业务流程适应行业法规和不断变化的条件,应该在优化PDP流程的新方法上做出更多努力。本文提出了一种求解PDP问题的数学方法。考虑到该问题的复杂性,提出了将遗传算法与混合整数线性规划模型相结合的方法。数学算法使用投币或分割开源求解器进行了测试。计算结果表明,所提出的数学算法可用于解决实际规模的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信