{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:13:01Z","timestamp":1778494381591,"version":"3.51.4"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In the globalized and fiercely competitive market environment, supply chain management plays a pivotal role in the operation and development of enterprises. A supply chain management optimization model based on improved genetic algorithm is proposed. Through simulation experiments, the performance in time, cost, and efficiency is verified. It is also compared with traditional strategies. The experimental results indicate that most of the time changes in the simulation process and standard delivery are roughly the same. The subtle difference appears after 600\u202fs. There is a significant difference at 1,100\u202fs, but it is quickly self calibrate. The inventory change value based on the inventory turnover control strategy is 0.2547, while the inventory change value based on the improved genetic algorithm control strategy is 0.2734, with a difference of 5.9\u202f%. The majority of supply chain efficiency under two control strategies is located in high efficiency areas, with efficiency greater than 92\u202f%. When delivering, in addition to supply efficiency, the efficiency of turnover days also needs to be considered. Most of the loss rate points are within 220\u202fg\/km. Compared to traditional control strategies, control strategies based on improved genetic algorithms have some advantages in the distribution of loss rates, with more points distributed between 190 and 210\u202fg\/km. Furthermore, compared with traditional methods, the proposed model has advantages in cost, time, and efficiency. Therefore, this research provides an optimization strategy for supply chain management, which is beneficial for improving the operational efficiency and development potential of enterprises in a globalized and fiercely competitive market environment.<\/jats:p>","DOI":"10.1515\/comp-2025-0041","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:02:30Z","timestamp":1774270950000},"source":"Crossref","is-referenced-by-count":0,"title":["Design of\u00a0supply chain management optimization model based on\u00a0improved genetic algorithm"],"prefix":"10.1515","volume":"16","author":[{"given":"Cheng","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Logistics , Wuhan Technical College of Communications , Wuhan 430065 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2026,3,20]]},"reference":[{"key":"2026051109411679546_j_comp-2025-0041_ref_001","doi-asserted-by":"crossref","unstructured":"A. V. Garsow et al.., \u201cExploring the relationship between gender and food safety risks in the dairy value chain in Ethiopia,\u201d Int. Dairy J., vol. 124, no. 1, p. 124, 2022. https:\/\/doi.org\/10.1016\/j.idairyj.2021.105173.","DOI":"10.1016\/j.idairyj.2021.105173"},{"key":"2026051109411679546_j_comp-2025-0041_ref_002","doi-asserted-by":"crossref","unstructured":"M. Madas and Y. Nikolaidis, \u201cExploring the relationship between quality management and risks in closed-loop supply chains,\u201d Int. J. Logist. Syst. Manag., vol. 44, no. 1, pp. 431\u2013457, 2023. https:\/\/doi.org\/10.1504\/ijlsm.2021.10038549.","DOI":"10.1504\/IJLSM.2023.130781"},{"key":"2026051109411679546_j_comp-2025-0041_ref_003","doi-asserted-by":"crossref","unstructured":"A. Azaron, U. Venkatadri, and A. Farhang Doost, \u201cDesigning profitable and responsive supply chains under uncertainty,\u201d Int. J. Prod. Res., vol. 59, no. 1, pp. 213\u2013225, 2020. https:\/\/doi.org\/10.1080\/00207543.2020.1785036.","DOI":"10.1080\/00207543.2020.1785036"},{"key":"2026051109411679546_j_comp-2025-0041_ref_004","doi-asserted-by":"crossref","unstructured":"C. R. Vishnu, S. P. Das, R. Sridharan, P. N. Ram Kumar, and N. S. Narahari, \u201cDevelopment of a reliable and flexible supply chain network design model: A genetic algorithm based approach,\u201d Int. J. Prod. Res., vol. 59, no. 1, pp. 6185\u20136209, 2020. https:\/\/doi.org\/10.1080\/00207543.2020.1808256.","DOI":"10.1080\/00207543.2020.1808256"},{"key":"2026051109411679546_j_comp-2025-0041_ref_005","doi-asserted-by":"crossref","unstructured":"T. Sawik, \u201cDisruption mitigation and recovery in supply chains using portfolio approach,\u201d Omega, vol.\u00a084, pp.\u00a0232\u2013248, 2019, https:\/\/doi.org\/10.1016\/j.omega.2018.05.006.","DOI":"10.1016\/j.omega.2018.05.006"},{"key":"2026051109411679546_j_comp-2025-0041_ref_006","doi-asserted-by":"crossref","unstructured":"D. Nel Jacobus and H. Simon, \u201cIntroducing a process for radical supply chain risk management,\u201d Int. J. Bus. Perform. Manag., vol. 21, no. 1, pp. 149\u2013165, 2020. https:\/\/doi.org\/10.1504\/ijbpm.2020.106120.","DOI":"10.1504\/IJBPM.2020.106120"},{"key":"2026051109411679546_j_comp-2025-0041_ref_007","doi-asserted-by":"crossref","unstructured":"M. Haque and A. A. Hasin, \u201cFuzzy genetic algorithm-based model for bullwhip effect reduction in a multi-stage supply chain,\u201d Int. J. Supply Chain Inventory Manag., vol. 4, no. 1, pp. 1\u201324, 2021. https:\/\/doi.org\/10.1504\/ijscim.2021.114720.","DOI":"10.1504\/IJSCIM.2021.114720"},{"key":"2026051109411679546_j_comp-2025-0041_ref_008","doi-asserted-by":"crossref","unstructured":"E. Badakhshan, P. Humphreys, L. Maguire, and R. McIvor, \u201cUsing simulation-based system dynamics and genetic algorithms toreduce the cash flow bullwhip in the supply chain,\u201d Int. J. Prod. Res., vol. 58, no. 17, pp. 5253\u20135279, 2020. https:\/\/doi.org\/10.1080\/00207543.2020.1715505.","DOI":"10.1080\/00207543.2020.1715505"},{"key":"2026051109411679546_j_comp-2025-0041_ref_009","doi-asserted-by":"crossref","unstructured":"M. Fathi, M. Khakifirooz, A. Diabat, and H. Chen, \u201cAn integrated queuing-stochastic optimization hybrid genetic algorithm for a location-inventory supply chain network,\u201d Int. J. Prod. Econ., vol. 237, no. 1, p. 108139, 2021. https:\/\/doi.org\/10.1016\/j.ijpe.2021.108139.","DOI":"10.1016\/j.ijpe.2021.108139"},{"key":"2026051109411679546_j_comp-2025-0041_ref_010","doi-asserted-by":"crossref","unstructured":"S. S. Dhage, V. S. Narwane, R. D. Raut, N. K. Dere, B. B. Gardas, and B. E. Narkhede, \u201cMathematical programming model to optimise an environmentally constructed supply chain: A genetic algorithm approach,\u201d Int. J. Oper. Res., vol. 44, no. 1, pp. 226\u2013253, 2022. https:\/\/doi.org\/10.1504\/ijor.2022.123395.","DOI":"10.1504\/IJOR.2022.123395"},{"key":"2026051109411679546_j_comp-2025-0041_ref_011","doi-asserted-by":"crossref","unstructured":"A. Chuluunsukh and Y. S. Yun, \u201cSupply chain network designmodel considering supplier and route disruptions: Hybrld genetic algorithm approach,\u201d Korea SCM Soc. J., vol. 21, no. 1, pp. 37\u201353, 2021.","DOI":"10.25052\/KSCM.2021.05.21.1.37"},{"key":"2026051109411679546_j_comp-2025-0041_ref_012","doi-asserted-by":"crossref","unstructured":"M. Mahjoob, S. S. Fazeli, S. Milanlouei, L. S. Tavassoli, and M. Mirmozaffari, \u201cA modified adaptive genetic algorithm for multi-product multi-period inventory routing problem,\u201d Sustain. Oper. Comput., vol. 3, no. 1, pp. 1\u20139, 2021. https:\/\/doi.org\/10.1016\/j.susoc.2021.08.002.","DOI":"10.1016\/j.susoc.2021.08.002"},{"key":"2026051109411679546_j_comp-2025-0041_ref_013","doi-asserted-by":"crossref","unstructured":"N. Nezamoddini, A. Gholami, and F. Aqlan, \u201cA risk-based optimization framework for integrated supply chains using genetic algorithm and artificial neural networks,\u201d Int. J. Prod. Econ., vol. 225, no. 1, p. 107569, 2020. https:\/\/doi.org\/10.1016\/j.ijpe.2019.107569.","DOI":"10.1016\/j.ijpe.2019.107569"},{"key":"2026051109411679546_j_comp-2025-0041_ref_014","doi-asserted-by":"crossref","unstructured":"H. L. Ma, Z. Wang, and F. T. Chan, \u201cHow important are supply chain collaborative factors in supply chain finance? A view of financial service providers in China,\u201d Int. J. Prod. Econ., vol. 219, no. 1, pp. 341\u2013346, 2020. https:\/\/doi.org\/10.1016\/j.ijpe.2019.07.002.","DOI":"10.1016\/j.ijpe.2019.07.002"},{"key":"2026051109411679546_j_comp-2025-0041_ref_015","doi-asserted-by":"crossref","unstructured":"C. Jingjing et al.., \u201cA blockchain-driven supply chain finance application for auto retail industry,\u201d Entropy, vol. 22, no. 1, p. 95, 2020. https:\/\/doi.org\/10.3390\/e22010095.","DOI":"10.3390\/e22010095"},{"key":"2026051109411679546_j_comp-2025-0041_ref_016","doi-asserted-by":"crossref","unstructured":"C. Jianxin, Z. Tonghua, and Y. Zhou, \u201cDynamics of a risk-averse newsvendor model with continuous-time delay in supply chain financing,\u201d Math. Comput. Simulat., vol. 169, no. 1, pp. 133\u2013148, 2020. https:\/\/doi.org\/10.1016\/j.matcom.2019.09.009.","DOI":"10.1016\/j.matcom.2019.09.009"},{"key":"2026051109411679546_j_comp-2025-0041_ref_017","doi-asserted-by":"crossref","unstructured":"M. F. Candas and E. Kutanoglu, \u201cIntegrated location and inventory planning in service parts logistics with customer-based service levels,\u201d Eur. J. Oper. Res., vol. 285, no. 1, pp. 279\u2013295, 2020. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.058.","DOI":"10.1016\/j.ejor.2020.01.058"},{"key":"2026051109411679546_j_comp-2025-0041_ref_018","doi-asserted-by":"crossref","unstructured":"S. Safaei, P. Ghasemi, F. Goodarzian, and M. Momenitabar, \u201cDesigning a new multi-echelon multi-period closed-loop supply chain network by forecasting demand using time series model: A genetic algorithm,\u201d Environ. Sci. Pollut. Res., vol. 29, no. 1, pp. 79754\u201379768, 2022. https:\/\/doi.org\/10.1007\/s11356-022-19341-5.","DOI":"10.1007\/s11356-022-19341-5"},{"key":"2026051109411679546_j_comp-2025-0041_ref_019","doi-asserted-by":"crossref","unstructured":"Y. Fang et al.., \u201cST-SIGMA: Spatio-temporal semantics and interaction graph aggregation for multi-agent perception and trajectory forecasting,\u201d CAAI Trans. Intell. Technol., vol.\u00a07, no.\u00a04, pp.\u00a0744\u2013757, 2022, https:\/\/doi.org\/10.1049\/cit2.12145.","DOI":"10.1049\/cit2.12145"},{"key":"2026051109411679546_j_comp-2025-0041_ref_020","doi-asserted-by":"crossref","unstructured":"Z. Chen, \u201cResearch on internet security situation awareness prediction technology based on improved RBF neural network algorithm,\u201d J. Comput. Cogn. Eng., vol.\u00a01, no.\u00a03, pp.\u00a0103\u2013108, 2022, https:\/\/doi.org\/10.47852\/bonviewjcce149145205514.","DOI":"10.47852\/bonviewJCCE149145205514"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0041\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0041\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:41:38Z","timestamp":1778492498000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0041\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,3,20]]},"published-print":{"date-parts":[[2026,1,23]]}},"alternative-id":["10.1515\/comp-2025-0041"],"URL":"https:\/\/doi.org\/10.1515\/comp-2025-0041","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,1]]},"article-number":"20250041"}}