An enhanced genetic-based multi-objective mathematical model for industrial supply chain network.

IF 2.6 3区 综合性期刊 Q1 MULTIDISCIPLINARY SCIENCES PLoS ONE Pub Date : 2025-03-04 eCollection Date: 2025-01-01 DOI:10.1371/journal.pone.0315545
Yanchun Li
{"title":"An enhanced genetic-based multi-objective mathematical model for industrial supply chain network.","authors":"Yanchun Li","doi":"10.1371/journal.pone.0315545","DOIUrl":null,"url":null,"abstract":"<p><p>The multi-objective supply chain needs a full look at enterprise costs, coordinated delivery of different products, and more fluidity and efficiency within the network of the supply chain. However, existing methodologies rarely delve into the intricacies of the industrial supply chain. Therefore, in the emerging industrial supply chain network, a model for the multi-objective problem was made using a meta-heuristic approach, specifically the improved genetic algorithm, which is a type of soft computing. To create the initial population, a hybrid approach that combines topology theory and the random search method was adopted, which resulted in a modification of the conventional single roulette wheel selection procedure. Additionally, the crossover and mutation operations were enhanced, with determining their respective probabilities determined through a fusion of the elite selection approach and the roulette method. The simulation results indicate that the improved genetic algorithm reduced the supply load from 0.678 to 0.535, labor costs from 1832 yuan to 1790 yuan, and operational time by approximately 39.5%, from 48 seconds to 29.5 seconds. Additionally, the variation in node utilization rates significantly decreased from 30.1% to 12.25%, markedly enhancing resource scheduling efficiency and overall balance within the supply chain.</p>","PeriodicalId":20189,"journal":{"name":"PLoS ONE","volume":"20 3","pages":"e0315545"},"PeriodicalIF":2.6000,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11878948/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PLoS ONE","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.1371/journal.pone.0315545","RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q1","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

Abstract

The multi-objective supply chain needs a full look at enterprise costs, coordinated delivery of different products, and more fluidity and efficiency within the network of the supply chain. However, existing methodologies rarely delve into the intricacies of the industrial supply chain. Therefore, in the emerging industrial supply chain network, a model for the multi-objective problem was made using a meta-heuristic approach, specifically the improved genetic algorithm, which is a type of soft computing. To create the initial population, a hybrid approach that combines topology theory and the random search method was adopted, which resulted in a modification of the conventional single roulette wheel selection procedure. Additionally, the crossover and mutation operations were enhanced, with determining their respective probabilities determined through a fusion of the elite selection approach and the roulette method. The simulation results indicate that the improved genetic algorithm reduced the supply load from 0.678 to 0.535, labor costs from 1832 yuan to 1790 yuan, and operational time by approximately 39.5%, from 48 seconds to 29.5 seconds. Additionally, the variation in node utilization rates significantly decreased from 30.1% to 12.25%, markedly enhancing resource scheduling efficiency and overall balance within the supply chain.

Abstract Image

Abstract Image

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进遗传的工业供应链网络多目标数学模型。
多目标供应链需要全面考虑企业成本,协调不同产品的交付,以及供应链网络内更多的流动性和效率。然而,现有的方法很少深入研究工业供应链的复杂性。因此,在新兴的工业供应链网络中,采用元启发式方法,即改进的遗传算法,建立了多目标问题的模型,这是一种软计算。为了创建初始总体,采用了一种结合拓扑理论和随机搜索方法的混合方法,对传统的单轮赌轮选择过程进行了改进。此外,交叉和突变操作得到增强,并通过融合精英选择方法和轮盘赌方法确定其各自的概率。仿真结果表明,改进后的遗传算法将供电负荷从0.678降至0.535,人工成本从1832元降至1790元,运行时间从48秒降至29.5秒,缩短约39.5%。节点利用率的变化从30.1%显著降低到12.25%,显著提高了资源调度效率和供应链的整体平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
PLoS ONE
PLoS ONE 生物-生物学
CiteScore
6.20
自引率
5.40%
发文量
14242
审稿时长
3.7 months
期刊介绍: PLOS ONE is an international, peer-reviewed, open-access, online publication. PLOS ONE welcomes reports on primary research from any scientific discipline. It provides: * Open-access—freely accessible online, authors retain copyright * Fast publication times * Peer review by expert, practicing researchers * Post-publication tools to indicate quality and impact * Community-based dialogue on articles * Worldwide media coverage
期刊最新文献
Analysis of factors influencing postoperative refractive status in patients with high myopia undergoing combined surgery for vitreous opacity and cataract. From problematic soil to engineered fill: Transforming granite residual soil with clay improvement. Shotgun metagenomic profiling reveals Bacillus-dominated bacterial communities in urban rooftop and surface garden soils of Bangladesh. Analysis of the failure state of the Cenozoic clay layer in thin bedrock coal seam mining: A case study of Sanyuan coal mine. Feasibility of MEG in assessing task-related oscillatory markers and evaluating cognitive changes in recently symptomatic carotid endarterectomy patients: A pilot study.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1