A knowledge-driven memetic algorithm for energy-aware flexible job shop scheduling with limited AGV transportation | 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 A knowledge-driven memetic algorithm for energy-aware flexible job shop scheduling with limited AGV transportation Yajie Huo, Fayong Zhang, Wenyin Gong This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7242105/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 02 Dec, 2025 Read the published version in Memetic Computing → Version 1 posted 11 You are reading this latest preprint version Abstract Flexible Job Shop Scheduling Problems (FJSP) traditionally assumeinfinite transportation resources or simplified transportation constraints.With the rise of intelligent manufacturing,Automated Guided Vehicles (AGVs) have emerged as essential transport resources due to their high flexibility and autonomy.The limited availability of AGVs can significantly impact overall production efficiency.Meanwhile, growing concerns about energy consumption and environmental sustainabilityunderscore the necessity of incorporating energy-related objectives into scheduling decisions.In this context, this paper addresses the Energy-aware FJSP with limited AGVs (EFJSP-AGV).A multi-objective mixed-integer programming (MMIP) model is developedto simultaneously minimize makespan and total energy consumption (TEC).To efficiently tackle this challenging problem,a knowledge-driven memetic algorithm (KDMA) is proposed.Specifically, an integrated initialization approach is devisedto efficiently generate promising initial solutions.Furthermore, a knowledge-driven variable neighborhood search (VNS) tailored tothe characteristics of the problem is developedto enhance the exploitation within the solution space.Additionally, effective energy-aware strategies for reducing energy consumption are incorporatedto achieve lower total energy usage.Experimental results indicate that the proposed KDMA outperforms comparison algorithms,validating its effectiveness in solving the EFJSP-AGV. Flexible job shop scheduling Automated guided vehicle Energy-aware scheduling Multi-objective optimization Memetic algorithm Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 02 Dec, 2025 Read the published version in Memetic Computing → Version 1 posted Editorial decision: Revision requested 30 Aug, 2025 Reviews received at journal 27 Aug, 2025 Reviews received at journal 18 Aug, 2025 Reviews received at journal 14 Aug, 2025 Reviewers agreed at journal 13 Aug, 2025 Reviewers agreed at journal 11 Aug, 2025 Reviewers agreed at journal 11 Aug, 2025 Reviewers invited by journal 11 Aug, 2025 Editor assigned by journal 05 Aug, 2025 Submission checks completed at journal 30 Jul, 2025 First submitted to journal 29 Jul, 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-7242105","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":500459232,"identity":"4a260ea1-a286-4dae-9094-23293cc81bdb","order_by":0,"name":"Yajie Huo","email":"","orcid":"","institution":"China University of Geosciences","correspondingAuthor":false,"prefix":"","firstName":"Yajie","middleName":"","lastName":"Huo","suffix":""},{"id":500459233,"identity":"7781b115-e971-43f5-9a09-752451a1e36a","order_by":1,"name":"Fayong Zhang","email":"","orcid":"","institution":"China University of Geosciences","correspondingAuthor":false,"prefix":"","firstName":"Fayong","middleName":"","lastName":"Zhang","suffix":""},{"id":500459234,"identity":"7db87025-ef5f-4bc9-95fa-7485f6cdf278","order_by":2,"name":"Wenyin Gong","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAxUlEQVRIiWNgGAWjYPACGwjFQ4KWNNK1HCZBi8GN9IuPC36dlzc4v4Dxwds2Bnlzwlpyio1n9t023HDjAbPh3DYGw50NBLSY3chJk+btuZ1gcOMAmzRvG0OCwQHitJwDaWH/TaSW9GPSPD8OJBicb2BjJkqL/Zk3zMa8DcmGM28wNkvOOSdhuIGQFsn29IePef7YyfOdP3zww5syG3mCtjAI5BgwMLYBGRKJDSCSkHog4D/+gIHhD4hB0PRRMApGwSgYqQAAbCpFJR/x/ysAAAAASUVORK5CYII=","orcid":"","institution":"China University of Geosciences","correspondingAuthor":true,"prefix":"","firstName":"Wenyin","middleName":"","lastName":"Gong","suffix":""}],"badges":[],"createdAt":"2025-07-29 10:23:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7242105/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7242105/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s12293-025-00488-w","type":"published","date":"2025-12-02T15:58:25+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":97723994,"identity":"0925a2c9-b69f-4c60-849d-74e8c9067200","added_by":"auto","created_at":"2025-12-08 16:10:40","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":990515,"visible":true,"origin":"","legend":"","description":"","filename":"KDMAEFJSP.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7242105/v1_covered_887556fd-0a47-4b10-aaa4-1b1940899c01.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A knowledge-driven memetic algorithm for energy-aware flexible job shop scheduling with limited AGV transportation","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":"memetic-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"meme","sideBox":"Learn more about [Memetic Computing](http://link.springer.com/journal/12289)","snPcode":"12293","submissionUrl":"https://submission.nature.com/new-submission/12293/3","title":"Memetic Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Flexible job shop scheduling, Automated guided vehicle, Energy-aware scheduling, Multi-objective optimization, Memetic algorithm","lastPublishedDoi":"10.21203/rs.3.rs-7242105/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7242105/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eFlexible Job Shop Scheduling Problems (FJSP) traditionally assumeinfinite transportation resources or simplified transportation constraints.With the rise of intelligent manufacturing,Automated Guided Vehicles (AGVs) have emerged as essential transport resources due to their high flexibility and autonomy.The limited availability of AGVs can significantly impact overall production efficiency.Meanwhile, growing concerns about energy consumption and environmental sustainabilityunderscore the necessity of incorporating energy-related objectives into scheduling decisions.In this context, this paper addresses the Energy-aware FJSP with limited AGVs (EFJSP-AGV).A multi-objective mixed-integer programming (MMIP) model is developedto simultaneously minimize makespan and total energy consumption (TEC).To efficiently tackle this challenging problem,a knowledge-driven memetic algorithm (KDMA) is proposed.Specifically, an integrated initialization approach is devisedto efficiently generate promising initial solutions.Furthermore, a knowledge-driven variable neighborhood search (VNS) tailored tothe characteristics of the problem is developedto enhance the exploitation within the solution space.Additionally, effective energy-aware strategies for reducing energy consumption are incorporatedto achieve lower total energy usage.Experimental results indicate that the proposed KDMA outperforms comparison algorithms,validating its effectiveness in solving the EFJSP-AGV.\u003c/p\u003e","manuscriptTitle":"A knowledge-driven memetic algorithm for energy-aware flexible job shop scheduling with limited AGV transportation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-08-19 04:12:59","doi":"10.21203/rs.3.rs-7242105/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-08-30T09:01:45+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-28T00:21:37+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-19T01:53:38+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-14T10:21:44+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"287829943946725266298133204298354375658","date":"2025-08-14T00:00:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"248919320195875776763122971933760306742","date":"2025-08-11T22:14:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"220540044640015596886953269880898145985","date":"2025-08-11T13:54:02+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-08-11T13:15:53+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-08-06T02:01:29+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-07-30T09:40:10+00:00","index":"","fulltext":""},{"type":"submitted","content":"Memetic Computing","date":"2025-07-29T10:14:17+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"memetic-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"meme","sideBox":"Learn more about [Memetic Computing](http://link.springer.com/journal/12289)","snPcode":"12293","submissionUrl":"https://submission.nature.com/new-submission/12293/3","title":"Memetic Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"f42f4f17-3d6e-4f1e-b71a-e70f28b55b46","owner":[],"postedDate":"August 19th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-12-08T16:04:32+00:00","versionOfRecord":{"articleIdentity":"rs-7242105","link":"https://doi.org/10.1007/s12293-025-00488-w","journal":{"identity":"memetic-computing","isVorOnly":false,"title":"Memetic Computing"},"publishedOn":"2025-12-02 15:58:25","publishedOnDateReadable":"December 2nd, 2025"},"versionCreatedAt":"2025-08-19 04:12:59","video":"","vorDoi":"10.1007/s12293-025-00488-w","vorDoiUrl":"https://doi.org/10.1007/s12293-025-00488-w","workflowStages":[]},"version":"v1","identity":"rs-7242105","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7242105","identity":"rs-7242105","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.