Exploring Vehicle Scheduling in Web 3.0-based Vehicular Networks with Time Window Constraints

Exploring Vehicle Scheduling in Web 3.0-based Vehicular Networks with Time Window Constraints | 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 Exploring Vehicle Scheduling in Web 3.0-based Vehicular Networks with Time Window Constraints Junhong Zhang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4109408/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 Vehicle Scheduling Problem (VSP), rooted in the Traveling Salesman Problem (TSP), poses a significant challenge in modern logistics, particularly within networks linked to manufacturing facilities. These logistics systems often grapple with increased shipping costs and encounter challenges in aligning service times with customer availability. In the context of Web 3.0, which emphasizes decentralized and interconnected systems, there is a growing need to optimize vehicle scheduling to meet the demands of this new paradigm.In response, this study introduces a comprehensive vehicle scheduling model that strategically incorporates both time windows and vehicle load constraints, taking into account the unique characteristics of Web 3.0 logistics networks. To address this model, we employ genetic algorithm methodologies, providing a detailed examination and explanation of the algorithmic processes involved. The genetic algorithm undergoes 100 iterations, refining the solution iteratively. Implementation of the model is executed using the MATLAB toolbox. Simulation computations are conducted, revealing that setting time windows and deadweight defaults to zero minimizes the overall path traversing all service points. This outcome validates the efficacy of the algorithm in mitigating challenges akin to those faced by traveling agents in Web 3.0 logistics scenarios.This research holds practical significance, offering insights that can be applied to optimize logistics routes in real-world production scenarios within the Web 3.0 landscape. The study's findings contribute to the judicious selection and enhancement of logistics operations, addressing cost concerns and refining service quality. The integration of time windows and load constraints proves pivotal in achieving operational efficiency and customer satisfaction within the Web 3.0 context. Web 3.0 Genetic Algorithm Logistics Optimization Time Windows 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-4109408","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":281650934,"identity":"4d56b4ba-03af-40f1-995b-291f03bec6dc","order_by":0,"name":"Junhong Zhang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA0ElEQVRIiWNgGAWjYBACNmbG9p8fKmzq97c3HyBOCx97c4O0xJk0xg08xxKI0yLHc7xBgrftMOMGiRwDIh0mkdhgIMGWxmwukfPxxhsGOzndBiK0JBTw2LBZ9rzdbDmHIdnY7AARWg5ISKTxMBzP3SbNw3AgcRsRWhobeAwOSzAcyHlGpBaeg80MPAmHDQxO5LARqYW9sY1Z4kBagmTPMWPLOQZE+EW+mf0Z48d/Ngn87M0Pb7ypsJMjqAUFSPAQGTXIWkjVMQpGwSgYBSMCAAABB0G50uuRnQAAAABJRU5ErkJggg==","orcid":"","institution":"Guangdong University of Technology","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Junhong","middleName":"","lastName":"Zhang","suffix":""}],"badges":[],"createdAt":"2024-03-15 16:46:49","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4109408/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4109408/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":76052499,"identity":"d019d777-9062-4c4c-8408-09ff57281b30","added_by":"auto","created_at":"2025-02-11 22:01:31","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1624189,"visible":true,"origin":"","legend":"","description":"","filename":"ExploringVehicleSchedulinginWeb30basedVehicularNetworkswithTimeWindowConstraints.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4109408/v1_covered_eea82e75-3a04-4dbf-9285-4d9527520129.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Exploring Vehicle Scheduling in Web 3.0-based Vehicular Networks with Time Window Constraints","fulltext":[],"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":true,"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":"Web 3.0, Genetic Algorithm, Logistics Optimization, Time Windows","lastPublishedDoi":"10.21203/rs.3.rs-4109408/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4109408/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The Vehicle Scheduling Problem (VSP), rooted in the Traveling Salesman Problem (TSP), poses a significant challenge in modern logistics, particularly within networks linked to manufacturing facilities. These logistics systems often grapple with increased shipping costs and encounter challenges in aligning service times with customer availability. In the context of Web 3.0, which emphasizes decentralized and interconnected systems, there is a growing need to optimize vehicle scheduling to meet the demands of this new paradigm.In response, this study introduces a comprehensive vehicle scheduling model that strategically incorporates both time windows and vehicle load constraints, taking into account the unique characteristics of Web 3.0 logistics networks. To address this model, we employ genetic algorithm methodologies, providing a detailed examination and explanation of the algorithmic processes involved. The genetic algorithm undergoes 100 iterations, refining the solution iteratively. Implementation of the model is executed using the MATLAB toolbox. Simulation computations are conducted, revealing that setting time windows and deadweight defaults to zero minimizes the overall path traversing all service points. This outcome validates the efficacy of the algorithm in mitigating challenges akin to those faced by traveling agents in Web 3.0 logistics scenarios.This research holds practical significance, offering insights that can be applied to optimize logistics routes in real-world production scenarios within the Web 3.0 landscape. The study's findings contribute to the judicious selection and enhancement of logistics operations, addressing cost concerns and refining service quality. The integration of time windows and load constraints proves pivotal in achieving operational efficiency and customer satisfaction within the Web 3.0 context.","manuscriptTitle":"Exploring Vehicle Scheduling in Web 3.0-based Vehicular Networks with Time Window Constraints","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-03-22 04:42:20","doi":"10.21203/rs.3.rs-4109408/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":"80b1802e-1a5f-4f07-b78f-6c207b0e73da","owner":[],"postedDate":"March 22nd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-02-11T21:53:21+00:00","versionOfRecord":[],"versionCreatedAt":"2024-03-22 04:42:20","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4109408","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4109408","identity":"rs-4109408","version":["v1"]},"buildId":"WrCJVZZCHTDjtuVLN7oU0","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}