优化供应链中综合生产调度和车辆路线问题的元启发式算法

D. Markovi, Ć. AleksandarSTANKOVI, Ć. DraganMARINKOVI, AR DraganPAMUČ
{"title":"优化供应链中综合生产调度和车辆路线问题的元启发式算法","authors":"D. Markovi, Ć. AleksandarSTANKOVI, Ć. DraganMARINKOVI, AR DraganPAMUČ","doi":"10.17559/tv-20240207001318","DOIUrl":null,"url":null,"abstract":": This paper examines the challenge of integrated production and distribution, aiming to deliver products to customers precisely on time. Customers, situated within the transportation network, have predefined requirements regarding demand volume and time frames. In the first phase ( F 1 ), the problem of planning and allocation of resources is presented as FJSP, while the second phase ( F 2 ) addresses the vehicle routing problem as CVRPTW. The first phase, F 1 , aims to optimize manufacturing processes by appropriately scheduling production tasks to maximize productivity and minimize the time of task execution on machines. Phase 2, F 2 , encompasses the process of distribution to customers, seeking to minimize the number of vehicles, delivery time, and overall distance travelled. As both problems are among the most challenging in combinatorial optimization, integrating these phases into a single supply chain system poses a significant challenge in problem-solving. A mathematical formulation has been developed to include planning and task allocation in production, as well as vehicle routing, to obtain an optimal solution to the integrated problem. The input data used in the observed case study represent real data in both the first and second phases, forming one integrated supply chain system. Experimental results support the applied methodology.","PeriodicalId":510054,"journal":{"name":"Tehnicki vjesnik - Technical Gazette","volume":"2 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Metaheuristic Algorithms for the Optimization of Integrated Production Scheduling and Vehicle Routing Problems in Supply Chains\",\"authors\":\"D. Markovi, Ć. AleksandarSTANKOVI, Ć. DraganMARINKOVI, AR DraganPAMUČ\",\"doi\":\"10.17559/tv-20240207001318\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": This paper examines the challenge of integrated production and distribution, aiming to deliver products to customers precisely on time. Customers, situated within the transportation network, have predefined requirements regarding demand volume and time frames. In the first phase ( F 1 ), the problem of planning and allocation of resources is presented as FJSP, while the second phase ( F 2 ) addresses the vehicle routing problem as CVRPTW. The first phase, F 1 , aims to optimize manufacturing processes by appropriately scheduling production tasks to maximize productivity and minimize the time of task execution on machines. Phase 2, F 2 , encompasses the process of distribution to customers, seeking to minimize the number of vehicles, delivery time, and overall distance travelled. As both problems are among the most challenging in combinatorial optimization, integrating these phases into a single supply chain system poses a significant challenge in problem-solving. A mathematical formulation has been developed to include planning and task allocation in production, as well as vehicle routing, to obtain an optimal solution to the integrated problem. The input data used in the observed case study represent real data in both the first and second phases, forming one integrated supply chain system. Experimental results support the applied methodology.\",\"PeriodicalId\":510054,\"journal\":{\"name\":\"Tehnicki vjesnik - Technical Gazette\",\"volume\":\"2 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tehnicki vjesnik - Technical Gazette\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17559/tv-20240207001318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tehnicki vjesnik - Technical Gazette","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17559/tv-20240207001318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

:本文探讨了生产与配送一体化所面临的挑战,其目标是将产品准时送到客户手中。位于运输网络内的客户对需求量和时限有预先确定的要求。在第一阶段(F 1)中,资源规划和分配问题以 FJSP 的形式呈现,而第二阶段(F 2)则以 CVRPTW 的形式解决车辆路由问题。第一阶段(F 1)的目标是通过合理安排生产任务来优化生产流程,从而最大限度地提高生产率,并最大限度地减少任务在机器上的执行时间。第二阶段,即 F 2,包括向客户配送的过程,寻求车辆数量、配送时间和总路程的最小化。由于这两个问题都是组合优化中最具挑战性的问题,因此将这些阶段整合到一个单一的供应链系统中对解决问题提出了巨大的挑战。我们开发了一种数学公式,将生产中的计划和任务分配以及车辆路线纳入其中,以获得综合问题的最优解。观察案例研究中使用的输入数据代表了第一和第二阶段的真实数据,形成了一个集成的供应链系统。实验结果支持所应用的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Metaheuristic Algorithms for the Optimization of Integrated Production Scheduling and Vehicle Routing Problems in Supply Chains
: This paper examines the challenge of integrated production and distribution, aiming to deliver products to customers precisely on time. Customers, situated within the transportation network, have predefined requirements regarding demand volume and time frames. In the first phase ( F 1 ), the problem of planning and allocation of resources is presented as FJSP, while the second phase ( F 2 ) addresses the vehicle routing problem as CVRPTW. The first phase, F 1 , aims to optimize manufacturing processes by appropriately scheduling production tasks to maximize productivity and minimize the time of task execution on machines. Phase 2, F 2 , encompasses the process of distribution to customers, seeking to minimize the number of vehicles, delivery time, and overall distance travelled. As both problems are among the most challenging in combinatorial optimization, integrating these phases into a single supply chain system poses a significant challenge in problem-solving. A mathematical formulation has been developed to include planning and task allocation in production, as well as vehicle routing, to obtain an optimal solution to the integrated problem. The input data used in the observed case study represent real data in both the first and second phases, forming one integrated supply chain system. Experimental results support the applied methodology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信