Study on Routing and Scheduling for Unmanned Electric Loaders Considering Charging | 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 Study on Routing and Scheduling for Unmanned Electric Loaders Considering Charging Xiaoxu Wei, Chen Niu, Lianzheng Zhao, Yongsheng Wang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4354276/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract The application of unmanned electric loader technology facilitates safe and efficient enterprise production. By framing the cargo transport from multiple bins to electric loader hoppers as an MDVRPTW-EV issue, this paper proposes the SPBO-ACO hybrid metaheuristic algorithm, which combines the local search capability of the Student Psychology Optimization algorithm with Ant Colony Optimization principles to address path planning challenges. The SPBO-ACO algorithm leverages route length classification, strong and weak perturbations, and learning operators to enhance solution exploration.Testing based on standard MDVRPTW benchmark test instances shows high scalability and stability with 25% of results exceeding or approaching optimal solutions in 20 benchmark cases while 85% have errors compared to optimal solutions that do not exceed 10%. When applied to an industrial setting, the algorithm significantly reduces the unmanned loader's driving distance during raw material feeding and filling, demonstrating its practical effectiveness. MDVRPTW-EV SPBO-ACO hybrid metaheuristic algorithm Perturbation operator Unmanned electric loader Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 12 Jun, 2024 Reviews received at journal 24 May, 2024 Reviews received at journal 21 May, 2024 Reviewers agreed at journal 17 May, 2024 Reviewers agreed at journal 14 May, 2024 Reviewers invited by journal 12 May, 2024 Editor assigned by journal 05 May, 2024 Submission checks completed at journal 02 May, 2024 First submitted to journal 01 May, 2024 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-4354276","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":298809432,"identity":"c940d2ff-b283-4b4f-a742-c3cbe29557de","order_by":0,"name":"Xiaoxu Wei","email":"","orcid":"","institution":"Wuhan University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Xiaoxu","middleName":"","lastName":"Wei","suffix":""},{"id":298809433,"identity":"72994ff7-44c6-4dcc-b9fd-8332770039cc","order_by":1,"name":"Chen Niu","email":"","orcid":"","institution":"Wuhan University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Chen","middleName":"","lastName":"Niu","suffix":""},{"id":298809434,"identity":"0cccba3d-c03b-4bd1-9bd7-8361ab6bafec","order_by":2,"name":"Lianzheng Zhao","email":"","orcid":"","institution":"Wuhan University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Lianzheng","middleName":"","lastName":"Zhao","suffix":""},{"id":298809435,"identity":"7e61e662-9b8d-402a-be80-20451fd46816","order_by":3,"name":"Yongsheng Wang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAt0lEQVRIiWNgGAWjYHACNoYPDAfALAmitTDOAGrhIUkLMw9JWgxupD97bNt2J3E/A/PB2zwMdnlEaMkxN85te5bYw8CWbM3DkFxMUIvZjRw26dxth4FaeMykgS5MbCCsJf2ZtCVYC/83YrUkmEkzQmxhI06L/Zk3ZpK9/w4b9xxmM7acY5BMWItke/oziR9nDsu2tzc/vPGmwo6wFgaBBCiDGUQYEFQPBPwHiFE1CkbBKBgFIxoAAOUHO514AKiJAAAAAElFTkSuQmCC","orcid":"","institution":"Wuhan University of Technology","correspondingAuthor":true,"prefix":"","firstName":"Yongsheng","middleName":"","lastName":"Wang","suffix":""}],"badges":[],"createdAt":"2024-05-01 12:36:11","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4354276/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4354276/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":56233367,"identity":"e0435928-36e6-4969-8cae-f17c9e206d4e","added_by":"auto","created_at":"2024-05-10 08:02:08","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2672809,"visible":true,"origin":"","legend":"","description":"","filename":"StudyonRoutingandSchedulingforUnmannedElectricLoadersConsideringCharging.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4354276/v1_covered_d9a7cace-7266-46f3-ba34-ff857d1baaf1.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Study on Routing and Scheduling for Unmanned Electric Loaders Considering Charging","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":"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":"MDVRPTW-EV, SPBO-ACO hybrid metaheuristic algorithm, Perturbation operator, Unmanned electric loader","lastPublishedDoi":"10.21203/rs.3.rs-4354276/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4354276/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The application of unmanned electric loader technology facilitates safe and efficient enterprise production. By framing the cargo transport from multiple bins to electric loader hoppers as an MDVRPTW-EV issue, this paper proposes the SPBO-ACO hybrid metaheuristic algorithm, which combines the local search capability of the Student Psychology Optimization algorithm with Ant Colony Optimization principles to address path planning challenges. The SPBO-ACO algorithm leverages route length classification, strong and weak perturbations, and learning operators to enhance solution exploration.Testing based on standard MDVRPTW benchmark test instances shows high scalability and stability with 25% of results exceeding or approaching optimal solutions in 20 benchmark cases while 85% have errors compared to optimal solutions that do not exceed 10%. When applied to an industrial setting, the algorithm significantly reduces the unmanned loader's driving distance during raw material feeding and filling, demonstrating its practical effectiveness.","manuscriptTitle":"Study on Routing and Scheduling for Unmanned Electric Loaders Considering Charging","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-05-10 07:53:58","doi":"10.21203/rs.3.rs-4354276/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-06-13T00:01:37+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-05-25T02:21:01+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-05-21T07:16:24+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"26488727322539543910132326350836434051","date":"2024-05-17T12:14:58+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"47774731080475673228951809617559949919","date":"2024-05-15T02:17:59+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-05-12T07:59:55+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-05-05T05:51:21+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-05-02T14:29:49+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cluster Computing","date":"2024-05-01T12:34:46+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":"d7b73b48-bfd9-47c0-8321-d3103643c8ea","owner":[],"postedDate":"May 10th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-10-15T14:54:22+00:00","versionOfRecord":[],"versionCreatedAt":"2024-05-10 07:53:58","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4354276","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4354276","identity":"rs-4354276","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.