Optimal Design of Circuit Breaker Based on Flower Pollination Algorithm

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-17

An adaptive-mutation catfish flower pollination algorithm was developed and applied to circuit breaker optimization, demonstrating improved performance over the basic algorithm and feasibility for practical circuit breaker design.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-17 · read from full text

The paper studies an optimization problem for the high-breaking and comprehensive design of a circuit breaker by applying an improved meta-heuristic. The authors propose an “adaptive-mutation catfish” flower pollination algorithm that modifies the global pollination stage with an adaptive step size and the local stage with a mutation strategy and a “catfish effect,” and they assess performance using classic test functions before applying it to a circuit breaker mathematical model. They report that the resulting circuit breaker design method is feasible and that the improved algorithm is effective. A major caveat is that the work is presented as a Research Square preprint and not peer reviewed by a journal, and the provided text does not detail further validation beyond algorithmic performance tests. 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

The flower pollination algorithm is a new meta-heuristic algorithm that simulates the pollination behavior of flowers in nature. Aiming at the problem that the basic flower pollination algorithm is easy to fall into the local optimum and the later convergence speed is slow, the "adaptive-mutation catfish" flower pollination algorithm is proposed, Introduce the adaptive step size in the global pollination stage, introduce the mutation strategy and catfish effect in the local pollination stage, and use the classic test function to analyze the performance of the improved algorithm. The improved flower pollination algorithm is applied to the high breaking and comprehensive optimization design of the circuit breaker, the mathematical model of the high breaking and comprehensive optimization of the circuit breaker is constructed, and the optimal design method of the circuit breaker based on the flower pollination algorithm is given. The results show that the circuit breaker optimization design method based on flower pollination algorithm is feasible, and the improved flower pollination algorithm is effective.
Full text 10,181 characters · extracted from preprint-html · click to expand
Optimal Design of Circuit Breaker Based on Flower Pollination 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 Research Article Optimal Design of Circuit Breaker Based on Flower Pollination Algorithm Guodong LI, Min XIE, Yunhe TIAN This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1531538/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract The flower pollination algorithm is a new meta-heuristic algorithm that simulates the pollination behavior of flowers in nature. Aiming at the problem that the basic flower pollination algorithm is easy to fall into the local optimum and the later convergence speed is slow, the "adaptive-mutation catfish" flower pollination algorithm is proposed, Introduce the adaptive step size in the global pollination stage, introduce the mutation strategy and catfish effect in the local pollination stage, and use the classic test function to analyze the performance of the improved algorithm. The improved flower pollination algorithm is applied to the high breaking and comprehensive optimization design of the circuit breaker, the mathematical model of the high breaking and comprehensive optimization of the circuit breaker is constructed, and the optimal design method of the circuit breaker based on the flower pollination algorithm is given. The results show that the circuit breaker optimization design method based on flower pollination algorithm is feasible, and the improved flower pollination algorithm is effective. flower pollination algorithm adaptive step size catfish effect mutation strategy circuit breaker optimization design Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-1531538","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":97072908,"identity":"5adef63b-957b-4696-a16a-cc97cd67bf70","order_by":0,"name":"Guodong LI","email":"","orcid":"","institution":"Tianjin Chengjian University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Guodong","middleName":"","lastName":"LI","suffix":""},{"id":97072912,"identity":"1f149d57-c5af-4a2e-ab85-e0b6a012f44a","order_by":1,"name":"Min XIE","email":"","orcid":"","institution":"Hebei University of Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Min","middleName":"","lastName":"XIE","suffix":""},{"id":97072915,"identity":"dadafc4d-b4ee-4c5e-8eaf-2371643deb56","order_by":2,"name":"Yunhe TIAN","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABMklEQVRIie3RMWrDMBQGYBmDvajp0OUFtc4VZARtoIYOvYhEIFka6hvUrkGeSlcXeogeocaQLDmAR5tApw6GQMjgoVKbzTZk7KB/ekj6eNITQiYm/zDnthXXDQ3wRBVVo5cAOX97n/1knCYJg3Du+arwM0SPhA8TullLwE3BkCou8CkElUIC0ELEmZB20LYiIslqe3ZA3qjk1i7sCisTyTSkC5GCkNulpCK6XC0Y5oiNS26TrEtsEHEJ9FZ3SdkyUgQeroki4qPkjo27xAF1BlNbROqGZNpq8rjX5GmIYJw/K3Kvnp9LgpzfLo4mnA4QcGM1ZKqHHCf+i2RMwvzGf5+D/7apE9JD7gq3rptWf6VbV4fWu3qF2Vf1HQST0XqW73pIz+uO7fU4o1OAiYmJiUk3P15VaQcRhIMBAAAAAElFTkSuQmCC","orcid":"","institution":"Hebei University of Technology","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Yunhe","middleName":"","lastName":"TIAN","suffix":""}],"badges":[],"createdAt":"2022-04-07 02:29:09","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1531538/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1531538/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":20205461,"identity":"fadbf1f5-c6af-47bf-82e9-aa9e968ef03c","added_by":"auto","created_at":"2022-04-11 17:04:53","extension":"pdf","order_by":2,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":653932,"visible":true,"origin":"","legend":"","description":"","filename":"OptimalDesignofCircuitBreakerBasedonFlowerPollinationAlgorithm.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1531538/v1_covered.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Optimal Design of Circuit Breaker Based on Flower Pollination Algorithm","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1531538/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"flower pollination algorithm, adaptive step size, catfish effect, mutation strategy, circuit breaker optimization design","lastPublishedDoi":"10.21203/rs.3.rs-1531538/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1531538/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe flower pollination algorithm is a new meta-heuristic algorithm that simulates the pollination behavior of flowers in nature. Aiming at the problem that the basic flower pollination algorithm is easy to fall into the local optimum and the later convergence speed is slow, the \"adaptive-mutation catfish\" flower pollination algorithm is proposed, Introduce the adaptive step size in the global pollination stage, introduce the mutation strategy and catfish effect in the local pollination stage, and use the classic test function to analyze the performance of the improved algorithm. The improved flower pollination algorithm is applied to the high breaking and comprehensive optimization design of the circuit breaker, the mathematical model of the high breaking and comprehensive optimization of the circuit breaker is constructed, and the optimal design method of the circuit breaker based on the flower pollination algorithm is given. The results show that the circuit breaker optimization design method based on flower pollination algorithm is feasible, and the improved flower pollination algorithm is effective.\u003c/p\u003e","manuscriptTitle":"Optimal Design of Circuit Breaker Based on Flower Pollination Algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-04-11 17:04:46","doi":"10.21203/rs.3.rs-1531538/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"0384ab24-7358-4158-b3c9-cc32de620174","owner":[],"postedDate":"April 11th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2022-04-11T17:04:47+00:00","versionOfRecord":[],"versionCreatedAt":"2022-04-11 17:04:46","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1531538","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1531538","identity":"rs-1531538","version":["v1"]},"buildId":"FbvkV6FR0MCFSLy54lSbu","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. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0