Multi-Objective Particle Swarm Algorithm Based on Density-Morphology Archive Maintenance and Dynamic Tracking Matrix Parameter Adjustment

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated deep summary by claude@2026-07, 2026-07-03 · read from full text

This paper proposes an improved multi-objective particle swarm optimization algorithm (MCMOPSO) to address limitations of traditional MOPSO in simultaneously improving convergence and solution-set distribution. Using a dual-dimensional density-morphology profile maintenance scheme, a dynamic tracking matrix parameter adjustment mechanism, and a percentile dominance framework, the authors evaluate performance against 10 classical algorithms on benchmark problems (ZDT, UF, DTLZ) using metrics including hyper-volume and inverse generational distance. The reported results indicate MCMOPSO achieves superior convergence, distribution uniformity, and stability across most test problems, with the study explicitly noting the work is a preprint that has not yet been peer reviewed. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract Addressing the limitations of traditional multi-objective particle swarm optimization (MOPSO) in achieving coordinated optimization of convergence efficiency and solution set distribution, this paper proposes an improved algorithm (MCMOPSO). This algorithm integrates a dual-dimensional density-morphology profile maintenance method with a parameter adjustment mechanism based on a dynamic tracking matrix. Its innovations are concentrated in three aspects: constructing an external density-morphology profile maintenance scheme to achieve precise screening of non-dominated solutions; designing a dynamic tracking matrix recognition system to finely regulate particle trajectories; and establishing a percentile dominance framework to efficiently guide the population toward the Pareto optimal frontier (PF). Comparative experiments were conducted between this algorithm and 10 classical algorithms on three benchmark test problems (ZDT, UF, DTLZ). Performance was quantitatively analyzed using metrics such as hyper-volume (HV) and inverse generational distance (IGD). Results demonstrate that MCMOPSO exhibits superior convergence, distribution uniformity, and stability across most test problems, providing an efficient and reliable solution for complex multi-objective optimization.
Full text 13,253 characters · extracted from preprint-html · click to expand
Multi-Objective Particle Swarm Algorithm Based on Density-Morphology Archive Maintenance and Dynamic Tracking Matrix Parameter Adjustment | 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 Research Article Multi-Objective Particle Swarm Algorithm Based on Density-Morphology Archive Maintenance and Dynamic Tracking Matrix Parameter Adjustment Jiangyan Xu, Yanmin Liu, Siwan Chen, Yu Jiang, Jie Yang, Qian Wang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9409611/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 8 You are reading this latest preprint version Abstract Addressing the limitations of traditional multi-objective particle swarm optimization (MOPSO) in achieving coordinated optimization of convergence efficiency and solution set distribution, this paper proposes an improved algorithm (MCMOPSO). This algorithm integrates a dual-dimensional density-morphology profile maintenance method with a parameter adjustment mechanism based on a dynamic tracking matrix. Its innovations are concentrated in three aspects: constructing an external density-morphology profile maintenance scheme to achieve precise screening of non-dominated solutions; designing a dynamic tracking matrix recognition system to finely regulate particle trajectories; and establishing a percentile dominance framework to efficiently guide the population toward the Pareto optimal frontier (PF). Comparative experiments were conducted between this algorithm and 10 classical algorithms on three benchmark test problems (ZDT, UF, DTLZ). Performance was quantitatively analyzed using metrics such as hyper-volume (HV) and inverse generational distance (IGD). Results demonstrate that MCMOPSO exhibits superior convergence, distribution uniformity, and stability across most test problems, providing an efficient and reliable solution for complex multi-objective optimization. Density-based two-dimensional archive maintenance Dynamic tracking matrix parameter adjustment mechanism Percentile dominance framework Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 06 May, 2026 Reviews received at journal 29 Apr, 2026 Reviewers agreed at journal 26 Apr, 2026 Reviewers agreed at journal 24 Apr, 2026 Reviewers invited by journal 24 Apr, 2026 Editor assigned by journal 19 Apr, 2026 Submission checks completed at journal 18 Apr, 2026 First submitted to journal 13 Apr, 2026 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-9409611","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":634111615,"identity":"89c94be0-19ca-4985-9d82-3c5d39b49636","order_by":0,"name":"Jiangyan Xu","email":"","orcid":"","institution":"Guizhou University","correspondingAuthor":false,"prefix":"","firstName":"Jiangyan","middleName":"","lastName":"Xu","suffix":""},{"id":634111616,"identity":"705788b7-42e1-4393-a620-e1301bcaee66","order_by":1,"name":"Yanmin Liu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA0ElEQVRIiWNgGAWjYLCCBIb/cmz8zQcOfPhBvBZmYz6JY4kHZ/YQbw9z4jyGHOPDHGxEqDU4fvbohoc72IzZGM58OMzAwyDPL3aAgJYzeWk3Es/wyLEx9244XGDBYDhzdgIBLQdyzG4ktkkAbTm74fAMHoYEg9uEtJx/A9JikNjGkPPgMA8bMVpugG1JAGlhIE6L5A2wLQeM2SSOGQADWYKwX/jO55jd/Nl2QE6+v/nxhw8/bOT5pQloUTiAypfArxwE5BsIqxkFo2AUjIKRDgA6ZEt3KkqP5QAAAABJRU5ErkJggg==","orcid":"","institution":"Zunyi Normal College","correspondingAuthor":true,"prefix":"","firstName":"Yanmin","middleName":"","lastName":"Liu","suffix":""},{"id":634111618,"identity":"e7ab4dd9-30e0-4a4a-b338-18dec20b5282","order_by":2,"name":"Siwan Chen","email":"","orcid":"","institution":"Guizhou University","correspondingAuthor":false,"prefix":"","firstName":"Siwan","middleName":"","lastName":"Chen","suffix":""},{"id":634111619,"identity":"5e23250e-a379-43b9-b83d-391e6e6b74f0","order_by":3,"name":"Yu Jiang","email":"","orcid":"","institution":"IFLYTEK Co., Ltd","correspondingAuthor":false,"prefix":"","firstName":"Yu","middleName":"","lastName":"Jiang","suffix":""},{"id":634111620,"identity":"25c20d92-b686-4c2a-b18e-4303487f0cea","order_by":4,"name":"Jie Yang","email":"","orcid":"","institution":"Zunyi Normal University","correspondingAuthor":false,"prefix":"","firstName":"Jie","middleName":"","lastName":"Yang","suffix":""},{"id":634111625,"identity":"06d5390e-03ed-4e96-a944-f6443c46d0f9","order_by":5,"name":"Qian Wang","email":"","orcid":"","institution":"Zunyi Normal College","correspondingAuthor":false,"prefix":"","firstName":"Qian","middleName":"","lastName":"Wang","suffix":""}],"badges":[],"createdAt":"2026-04-14 02:38:45","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9409611/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9409611/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":108494164,"identity":"74fbd073-b282-4897-843d-848895c5b9ab","added_by":"auto","created_at":"2026-05-05 10:02:42","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1367354,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9409611/v1_covered_ffe25cd8-2749-4859-be9e-06498891c7b5.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Multi-Objective Particle Swarm Algorithm Based on Density-Morphology Archive Maintenance and Dynamic Tracking Matrix Parameter Adjustment","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-machine-learning-and-cybernetics","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jmlc","sideBox":"Learn more about [International Journal of Machine Learning and Cybernetics](http://actavetscand.biomedcentral.com/)","snPcode":"13042","submissionUrl":"https://submission.nature.com/new-submission/13042/3","title":"International Journal of Machine Learning and Cybernetics","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Density-based two-dimensional archive maintenance, Dynamic tracking matrix parameter adjustment mechanism, Percentile dominance framework","lastPublishedDoi":"10.21203/rs.3.rs-9409611/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9409611/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eAddressing the limitations of traditional multi-objective particle swarm optimization (MOPSO) in achieving coordinated optimization of convergence efficiency and solution set distribution, this paper proposes an improved algorithm (MCMOPSO). This algorithm integrates a dual-dimensional density-morphology profile maintenance method with a parameter adjustment mechanism based on a dynamic tracking matrix. Its innovations are concentrated in three aspects: constructing an external density-morphology profile maintenance scheme to achieve precise screening of non-dominated solutions; designing a dynamic tracking matrix recognition system to finely regulate particle trajectories; and establishing a percentile dominance framework to efficiently guide the population toward the Pareto optimal frontier (PF). Comparative experiments were conducted between this algorithm and 10 classical algorithms on three benchmark test problems (ZDT, UF, DTLZ). Performance was quantitatively analyzed using metrics such as hyper-volume (HV) and inverse generational distance (IGD). Results demonstrate that MCMOPSO exhibits superior convergence, distribution uniformity, and stability across most test problems, providing an efficient and reliable solution for complex multi-objective optimization.\u003c/p\u003e","manuscriptTitle":"Multi-Objective Particle Swarm Algorithm Based on Density-Morphology Archive Maintenance and Dynamic Tracking Matrix Parameter Adjustment","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-05-05 07:57:18","doi":"10.21203/rs.3.rs-9409611/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-05-06T08:36:38+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-04-29T14:59:40+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"254216076615106140250352113666204797313","date":"2026-04-26T07:19:02+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"12013231423230471744042415108469202828","date":"2026-04-24T22:40:55+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-04-24T11:44:10+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-04-19T08:15:53+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-04-18T16:00:13+00:00","index":"","fulltext":""},{"type":"submitted","content":"International Journal of Machine Learning and Cybernetics","date":"2026-04-14T02:25:56+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-machine-learning-and-cybernetics","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jmlc","sideBox":"Learn more about [International Journal of Machine Learning and Cybernetics](http://actavetscand.biomedcentral.com/)","snPcode":"13042","submissionUrl":"https://submission.nature.com/new-submission/13042/3","title":"International Journal of Machine Learning and Cybernetics","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"ca47ecfb-5d43-4b5d-a58d-2c5b5f1ecf6e","owner":[],"postedDate":"May 5th, 2026","published":true,"recentEditorialEvents":[{"type":"editorInvitedReview","content":"","date":"2026-05-06T08:36:38+00:00","index":10,"fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-04-29T14:59:40+00:00","index":9,"fulltext":""}],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-05T07:57:19+00:00","versionOfRecord":[],"versionCreatedAt":"2026-05-05 07:57:18","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9409611","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9409611","identity":"rs-9409611","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0