An elited-weights whale optimization algorithm with local grey wolf optimal regulation for solving charging and swapping scheduling problem

preprint OA: closed
Full text JSON View at publisher
Full text 12,859 characters · extracted from preprint-html · click to expand
An elited-weights whale optimization algorithm with local grey wolf optimal regulation for solving charging and swapping scheduling problem | 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 An elited-weights whale optimization algorithm with local grey wolf optimal regulation for solving charging and swapping scheduling problem Guangjun Zai, Junjian Li, Lihong Zhong, Wei She This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6760084/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 11 You are reading this latest preprint version Abstract Whale Optimization Algorithm (WOA) is a meta-heuristic algorithm widely utilized in the field of engineering optimization. However, it has defects such as the low solution accuracy, slower convergence, and a tendency to fall into local optimum.To overcome these shortcomings, a novel approach is proposed in this paper, named EGRMWOA.First, we design an adaptive elite weight mechanism to achieve a balance between global exploration and local exploitation by dynamically adjusting the influence of elite solution.Second, by introducing a local grey wolf optimal regulation, a refined search is conducted around the current optimal solution, enhancing the solution accuracy and local development capability.Moreover, we improve the random search formula to help convergence.Finally, we introduce a similarity elimination and perturbation mutation strategy, this increases population diversity and enhances the ability to escape local optima.The results on 23 international test functions and CEC2019 show that EGRMWOA outperforms many WOA variants and other well-known meta-heuristic algorithms.In 15 real-world engineering optimization problems, EGRMWOA demonstrates exceptional solving capabilities with an average ranking of 2.833.In the practical optimization problem of electric vehicle charging and swapping scheduling, its performance surpasses that of WOA and GWO. Whale optimization algorithm Swarm-intelligence Adaptive elite weights Local grey wolf optimal regulation Charging and swapping scheduling Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 16 Sep, 2025 Reviews received at journal 02 Jul, 2025 Reviews received at journal 27 Jun, 2025 Reviewers agreed at journal 23 Jun, 2025 Reviews received at journal 17 Jun, 2025 Reviewers agreed at journal 17 Jun, 2025 Reviewers agreed at journal 17 Jun, 2025 Reviewers invited by journal 17 Jun, 2025 Editor assigned by journal 28 May, 2025 Submission checks completed at journal 27 May, 2025 First submitted to journal 27 May, 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-6760084","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":472555605,"identity":"2d406d89-9043-4b63-897b-ade3be45ee3e","order_by":0,"name":"Guangjun Zai","email":"","orcid":"","institution":"Zhengzhou University","correspondingAuthor":false,"prefix":"","firstName":"Guangjun","middleName":"","lastName":"Zai","suffix":""},{"id":472555613,"identity":"8b0cdb31-d1d6-40ef-9857-a3319f1af736","order_by":1,"name":"Junjian Li","email":"","orcid":"","institution":"Zhengzhou University","correspondingAuthor":false,"prefix":"","firstName":"Junjian","middleName":"","lastName":"Li","suffix":""},{"id":472555614,"identity":"1c0f2dbb-e7cb-4f33-939d-b74d424eb900","order_by":2,"name":"Lihong Zhong","email":"","orcid":"","institution":"Zhengzhou University","correspondingAuthor":false,"prefix":"","firstName":"Lihong","middleName":"","lastName":"Zhong","suffix":""},{"id":472555615,"identity":"a208741e-1581-4e7a-bd92-9e84ffbc638b","order_by":3,"name":"Wei She","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAArklEQVRIiWNgGAWjYFACHgaGDxCWAfFaGGeQrIWZhyQtBufPHnxs86cusYG9eZsEQ80dIrTcyEs2zuFhS2zgOVYmwXDsGWEtZjd4zKRzJHgSGyRyzCQYGw4ToeX8GfPfFgYSiQ3yb4jVciDHjJkhwQBoCw+RWuxv5BhL9hxIMG7jSSu2SDhGhBbJ/jOGH378qZPtZz+88caHGiK0wAEbiEggQcMoGAWjYBSMAjwAAEsqNAWCgn3WAAAAAElFTkSuQmCC","orcid":"","institution":"Zhengzhou University","correspondingAuthor":true,"prefix":"","firstName":"Wei","middleName":"","lastName":"She","suffix":""}],"badges":[],"createdAt":"2025-05-27 13:53:10","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6760084/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6760084/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":84946048,"identity":"c007b653-28f2-4173-988a-61ea413a6fef","added_by":"auto","created_at":"2025-06-19 06:12:08","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":604708,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6760084/v1_covered_1448e79f-15a2-4587-99db-f990284f3f9a.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"An elited-weights whale optimization algorithm with local grey wolf optimal regulation for solving charging and swapping scheduling problem","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":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Whale optimization algorithm, Swarm-intelligence, Adaptive elite weights, Local grey wolf optimal regulation, Charging and swapping scheduling","lastPublishedDoi":"10.21203/rs.3.rs-6760084/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6760084/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eWhale Optimization Algorithm (WOA) is a meta-heuristic algorithm widely utilized in the field of engineering optimization. However, it has defects such as the low solution accuracy, slower convergence, and a tendency to fall into local optimum.To overcome these shortcomings, a novel approach is proposed in this paper, named EGRMWOA.First, we design an adaptive elite weight mechanism to achieve a balance between global exploration and local exploitation by dynamically adjusting the influence of elite solution.Second, by introducing a local grey wolf optimal regulation, a refined search is conducted around the current optimal solution, enhancing the solution accuracy and local development capability.Moreover, we improve the random search formula to help convergence.Finally, we introduce a similarity elimination and perturbation mutation strategy, this increases population diversity and enhances the ability to escape local optima.The results on 23 international test functions and CEC2019 show that EGRMWOA outperforms many WOA variants and other well-known meta-heuristic algorithms.In 15 real-world engineering optimization problems, EGRMWOA demonstrates exceptional solving capabilities with an average ranking of 2.833.In the practical optimization problem of electric vehicle charging and swapping scheduling, its performance surpasses that of WOA and GWO.\u003c/p\u003e","manuscriptTitle":"An elited-weights whale optimization algorithm with local grey wolf optimal regulation for solving charging and swapping scheduling problem","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-19 05:37:28","doi":"10.21203/rs.3.rs-6760084/v1","editorialEvents":[{"type":"communityComments","content":1},{"type":"decision","content":"Revision requested","date":"2025-09-16T20:48:37+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-07-02T05:47:16+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-27T08:11:08+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"158391295624545620466448169598521856488","date":"2025-06-23T13:04:40+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-17T12:24:34+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"295016925921903635268329052901441523389","date":"2025-06-17T06:20:47+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"96857165219644559700402828215784818424","date":"2025-06-17T06:20:35+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-17T06:19:10+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-05-28T09:13:03+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-05-27T14:48:06+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cluster Computing","date":"2025-05-27T13:39:05+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"13f0422d-015a-4966-898e-604860444137","owner":[],"postedDate":"June 19th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-03-20T03:54:56+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-19 05:37:28","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6760084","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6760084","identity":"rs-6760084","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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 (2025) — 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