MODEMS: A Tailored Solution for Promoting On-Campus Passenger Mobility

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
Full text 12,607 characters · extracted from preprint-html · click to expand
MODEMS: A Tailored Solution for Promoting On-Campus Passenger Mobility | 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 MODEMS: A Tailored Solution for Promoting On-Campus Passenger Mobility Mostafa Emam, Björn Martens, Thomas Rottmann, Matthias Gerdts Gerdts This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8769914/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 6 You are reading this latest preprint version Abstract MODEMS ( M unich O n- D emand E lectric M obility S ervice) showcases a Proof-of-Concept (PoC) for enhancing on-campus mobility through the integration of a fleet of Electric Vehicles (EVs), an operational route planning algorithm, and an interactive online portal. The framework enables users to submit transportation requests between designated service stations across the university campus and subsequently notifies them of the request acceptance or rejection based on system availability. Each request comprises a pickup and a delivery location, a passenger count, and a desired service time window at either pickup or delivery. Fleet agents are primarily characterized by their maximum passenger capacity and battery State-of-Charge (SoC) constraints. The core objective is to fulfill all user requests within their respective time windows, while minimizing the cumulative fleet travel time. The problem represents an advanced variant of the multi-agent Capacitated Vehicle Routing Problem with Pickup, Delivery and Time Windows (CVRPPDTW) constraints, for which we present three Mixed-Integer Linear Programming (MILP) formulations. Due to the unpredictability of MILP solution times, we also implement an Adaptive Large Neighborhood Search (ALNS) algorithm as a supplementary strategy to guarantee the generation of routing plans within reasonable time limits. All strategies are evaluated in curated experiments to validate their operational efficacy in realistic scenarios. Finally, we discuss the achieved results, followed by exploring potential future research directions. Electric Vehicle Routing Problem Pickup and Delivery Time Windows VRPPDTW DARP MILP On-Demand Mobility Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 19 Mar, 2026 Reviewers agreed at journal 06 Mar, 2026 Reviewers invited by journal 23 Feb, 2026 Editor assigned by journal 08 Feb, 2026 Submission checks completed at journal 03 Feb, 2026 First submitted to journal 02 Feb, 2026 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-8769914","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":587715569,"identity":"1497acad-8c8d-4dc0-88fe-5ccc3660b4bf","order_by":0,"name":"Mostafa Emam","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA4UlEQVRIiWNgGAWjYNACGyj9gYGBxwBISxBQz9jAkAZlzSBZCzMPkCCoRbe9/fmDHwl2DPxih59utm27I2MukcB44wMeLWZnzhg29iQkM0jOTjO7ndv2jMdyRgKz5Qx8Wm7kMDbw/mBmMLidANJymAfIYJPmwasl/WHjn4R6Bvvb6d9uW8K0/MGrJcGwmSfhMIOBdI7ZbUaYFnzeB/lltkzCcR6J2zllN3vOHeaxnP+w2bIHn5bj7Q8+vkmoluOfnb7txo+yw/bmPIcP3viBzxooQPYvMKJGwSgYBaNgFFAGAGpqUN5BNU9fAAAAAElFTkSuQmCC","orcid":"","institution":"Bundeswehr University Munich","correspondingAuthor":true,"prefix":"","firstName":"Mostafa","middleName":"","lastName":"Emam","suffix":""},{"id":587715570,"identity":"01a5ddd7-5916-4fef-a975-20c941622cf0","order_by":1,"name":"Björn Martens","email":"","orcid":"","institution":"Bundeswehr University Munich","correspondingAuthor":false,"prefix":"","firstName":"Björn","middleName":"","lastName":"Martens","suffix":""},{"id":587715571,"identity":"66bffcbe-e11d-4530-8fda-54be524dac04","order_by":2,"name":"Thomas Rottmann","email":"","orcid":"","institution":"Bundeswehr University Munich","correspondingAuthor":false,"prefix":"","firstName":"Thomas","middleName":"","lastName":"Rottmann","suffix":""},{"id":587715572,"identity":"58a5cb30-5c07-4e65-90d8-addd5e07d051","order_by":3,"name":"Matthias Gerdts Gerdts","email":"","orcid":"","institution":"Bundeswehr University Munich","correspondingAuthor":false,"prefix":"","firstName":"Matthias","middleName":"Gerdts","lastName":"Gerdts","suffix":""}],"badges":[],"createdAt":"2026-02-03 02:08:32","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8769914/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8769914/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":102749402,"identity":"208acc8a-e231-40ee-a0bf-16af81d04536","added_by":"auto","created_at":"2026-02-16 09:12:35","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":4043080,"visible":true,"origin":"","legend":"","description":"","filename":"rootrev.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8769914/v1_covered_b628ab40-5e66-4989-a668-1262262d6641.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"MODEMS: A Tailored Solution for Promoting On-Campus Passenger Mobility","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"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":"computational-science-and-engineering","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Computational Science and Engineering](https://link.springer.com/journal/44207)","snPcode":"44207","submissionUrl":"https://submission.springernature.com/new-submission/44207/3","title":"Computational Science and Engineering","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Open","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Electric Vehicle Routing Problem, Pickup and Delivery, Time Windows, VRPPDTW, DARP, MILP, On-Demand Mobility","lastPublishedDoi":"10.21203/rs.3.rs-8769914/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8769914/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003e\u003cb\u003eMODEMS\u003c/b\u003e (\u003cb\u003eM\u003c/b\u003eunich \u003cb\u003eO\u003c/b\u003en-\u003cb\u003eD\u003c/b\u003eemand \u003cb\u003eE\u003c/b\u003electric \u003cb\u003eM\u003c/b\u003eobility \u003cb\u003eS\u003c/b\u003eervice) showcases a Proof-of-Concept (PoC) for enhancing on-campus mobility through the integration of a fleet of Electric Vehicles (EVs), an operational route planning algorithm, and an interactive online portal. The framework enables users to submit transportation requests between designated service stations across the university campus and subsequently notifies them of the request acceptance or rejection based on system availability. Each request comprises a pickup and a delivery location, a passenger count, and a desired service time window at either pickup or delivery. Fleet agents are primarily characterized by their maximum passenger capacity and battery State-of-Charge (SoC) constraints. The core objective is to fulfill all user requests within their respective time windows, while minimizing the cumulative fleet travel time. The problem represents an advanced variant of the multi-agent Capacitated Vehicle Routing Problem with Pickup, Delivery and Time Windows (CVRPPDTW) constraints, for which we present three Mixed-Integer Linear Programming (MILP) formulations. Due to the unpredictability of MILP solution times, we also implement an Adaptive Large Neighborhood Search (ALNS) algorithm as a supplementary strategy to guarantee the generation of routing plans within reasonable time limits. All strategies are evaluated in curated experiments to validate their operational efficacy in realistic scenarios. Finally, we discuss the achieved results, followed by exploring potential future research directions.\u003c/p\u003e","manuscriptTitle":"MODEMS: A Tailored Solution for Promoting On-Campus Passenger Mobility","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-16 06:21:54","doi":"10.21203/rs.3.rs-8769914/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-03-19T17:12:40+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"144417289990757368258233292326276610232","date":"2026-03-06T08:54:40+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-23T15:44:51+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-02-08T13:17:15+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-02-04T01:05:51+00:00","index":"","fulltext":""},{"type":"submitted","content":"Computational Science and Engineering","date":"2026-02-03T02:00:14+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"computational-science-and-engineering","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Computational Science and Engineering](https://link.springer.com/journal/44207)","snPcode":"44207","submissionUrl":"https://submission.springernature.com/new-submission/44207/3","title":"Computational Science and Engineering","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Open","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"37495032-5b7b-46d0-9c21-4eacb9e7880e","owner":[],"postedDate":"February 16th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-02-23T15:54:05+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-16 06:21:54","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8769914","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8769914","identity":"rs-8769914","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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 (2026) — 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
unpaywall
last seen: 2026-05-20T11:00:21.680559+00:00
License: CC-BY-4.0