Sustainable closed-loop supply chain network planning considering price competition using particle chaotic ant colony algorithm

Sustainable closed-loop supply chain network planning considering price competition using particle chaotic ant colony algorithm | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Sustainable closed-loop supply chain network planning considering price competition using particle chaotic ant colony algorithm Tianrui Zhang, Quanfeng He, Weibo Zhao, Mingqi Wei This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5429297/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 23 May, 2025 Read the published version in Scientific Reports → Version 1 posted 6 You are reading this latest preprint version Abstract Considering the impact of environmental pollution and market competition on the business model of enterprises, a method of constructing sustainable supply chain network model under the price competition environment is proposed to achieve the balance of economic benefit, ecological benefit, environmental benefit and social benefit. Firstly, based on the concepts of sustainability and price competition, the model with maximum total network profit, minimum carbon emission and maximum social benefit is designed. Secondly, based on fuzzy programming theory, an expected value fuzzy chance constrained programming model with confidence measure is constructed to address the challenge of designing a sustainable closed-loop supply chain network in the face of uncertain conditions. Thirdly, the problems of premature convergence and slow convergence during the traditional particle swarm optimization algorithm and genetic algorithm are solved with the particle chaotic ant colony algorithm (PSCACO). Finally, taking a manufacturing enterprise as an example. By analyzing the different confidence level measures under single objective optimization and multi-objective optimization, sustainable closed-loop supply chain network planning method established is verified on feasibility and effectiveness. Earth and environmental sciences/Environmental social sciences Physical sciences/Mathematics and computing sustainable supply chain network expected value fuzzy programming model chance constraint credibility measure particle chaos ant colony algorithm Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 23 May, 2025 Read the published version in Scientific Reports → Version 1 posted Editorial decision: Accepted 14 May, 2025 Reviews received at journal 01 May, 2025 Reviewers agreed at journal 29 Apr, 2025 Reviewers invited by journal 29 Apr, 2025 Submission checks completed at journal 28 Apr, 2025 First submitted to journal 24 Apr, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-5429297","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":449491573,"identity":"0c6f2cd6-4e37-4462-b6b3-a85b028de47f","order_by":0,"name":"Tianrui Zhang","email":"","orcid":"","institution":"Shenyang University","correspondingAuthor":false,"prefix":"","firstName":"Tianrui","middleName":"","lastName":"Zhang","suffix":""},{"id":449491574,"identity":"11f11816-da37-4881-88a0-5d2d321bcb3e","order_by":1,"name":"Quanfeng He","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA4klEQVRIie3RsW6DMBCA4YssOcuprI5AyStcMqA+ji0kJiIxMiCVqhUMVfc8RsdsCULyRHY6lUxd6ZYhQ83cCOiWwf98n+yzAWy2O4yvqrLtKH06fH2XrUzScfIgeLDexXqWHaOA2lqPk6VA38WOGSL9xfmVTbiYm4eLHfHehInKODjFmxwmXlU9duQZ86wbtfdA1KePYQKh+jSnIGcQNqrmQGI7RiJykZhADn6scjaBiGjTExIIPkwjqM0jk5bGBELWGkd3WRUv5iuvqSHz8ueSpEuneB8mf8L/jdtsNpvtZr9ifEgPWPpFSQAAAABJRU5ErkJggg==","orcid":"","institution":"Shenyang University","correspondingAuthor":true,"prefix":"","firstName":"Quanfeng","middleName":"","lastName":"He","suffix":""},{"id":449491575,"identity":"54c45282-c994-4ad4-a097-40316abe99b7","order_by":2,"name":"Weibo Zhao","email":"","orcid":"","institution":"Shenyang University","correspondingAuthor":false,"prefix":"","firstName":"Weibo","middleName":"","lastName":"Zhao","suffix":""},{"id":449491576,"identity":"832d71be-885f-49c2-a6bb-6c1a8daf1402","order_by":3,"name":"Mingqi Wei","email":"","orcid":"","institution":"Dalian University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Mingqi","middleName":"","lastName":"Wei","suffix":""}],"badges":[],"createdAt":"2024-11-11 06:23:37","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5429297/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5429297/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-025-02656-x","type":"published","date":"2025-05-23T15:57:53+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":83460188,"identity":"00ba6889-061b-48c4-bd96-a310dbfcde4d","added_by":"auto","created_at":"2025-05-26 16:11:44","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1149953,"visible":true,"origin":"","legend":"","description":"","filename":"Sustainableclosedloopsupplychainnetworkplanningconsideringpricecompetitionusingparticlechaoticantcolonyalgorithm.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5429297/v1_covered_d1aefcc5-837e-4016-80bd-38e5efa3c636.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Sustainable closed-loop supply chain network planning considering price competition using particle chaotic ant colony algorithm","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"sustainable supply chain network, expected value fuzzy programming model, chance constraint, credibility measure, particle chaos ant colony algorithm","lastPublishedDoi":"10.21203/rs.3.rs-5429297/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5429297/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eConsidering the impact of environmental pollution and market competition on the business model of enterprises, a method of constructing sustainable supply chain network model under the price competition environment is proposed to achieve the balance of economic benefit, ecological benefit, environmental benefit and social benefit. Firstly, based on the concepts of sustainability and price competition, the model with maximum total network profit, minimum carbon emission and maximum social benefit is designed. Secondly, based on fuzzy programming theory, an expected value fuzzy chance constrained programming model with confidence measure is constructed to address the challenge of designing a sustainable closed-loop supply chain network in the face of uncertain conditions. Thirdly, the problems of premature convergence and slow convergence during the traditional particle swarm optimization algorithm and genetic algorithm are solved with the particle chaotic ant colony algorithm (PSCACO). Finally, taking a manufacturing enterprise as an example. By analyzing the different confidence level measures under single objective optimization and multi-objective optimization, sustainable closed-loop supply chain network planning method established is verified on feasibility and effectiveness.\u003c/p\u003e","manuscriptTitle":"Sustainable closed-loop supply chain network planning considering price competition using particle chaotic ant colony algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-04-30 04:34:46","doi":"10.21203/rs.3.rs-5429297/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Accepted","date":"2025-05-15T01:20:43+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-05-01T04:11:22+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"161266819687407336049737754543105938852","date":"2025-04-29T06:27:50+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-04-29T05:54:06+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-04-28T14:58:50+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2025-04-24T05:11:34+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"3f28ba94-9109-4308-ae17-365a431548c8","owner":[],"postedDate":"April 30th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":47830617,"name":"Earth and environmental sciences/Environmental social sciences"},{"id":47830618,"name":"Physical sciences/Mathematics and computing"}],"tags":[],"updatedAt":"2025-05-26T16:06:30+00:00","versionOfRecord":{"articleIdentity":"rs-5429297","link":"https://doi.org/10.1038/s41598-025-02656-x","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2025-05-23 15:57:53","publishedOnDateReadable":"May 23rd, 2025"},"versionCreatedAt":"2025-04-30 04:34:46","video":"","vorDoi":"10.1038/s41598-025-02656-x","vorDoiUrl":"https://doi.org/10.1038/s41598-025-02656-x","workflowStages":[]},"version":"v1","identity":"rs-5429297","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5429297","identity":"rs-5429297","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}