Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/115659
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electrical and Electronic Engineering | en_US |
| dc.creator | Luo, X | en_US |
| dc.creator | Fan, W | en_US |
| dc.creator | Xu, M | en_US |
| dc.creator | Yan, X | en_US |
| dc.date.accessioned | 2025-10-16T02:55:52Z | - |
| dc.date.available | 2025-10-16T02:55:52Z | - |
| dc.identifier.issn | 0968-090X | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/115659 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier Ltd | en_US |
| dc.subject | Continuum approximation | en_US |
| dc.subject | Decoupling operation | en_US |
| dc.subject | Modular autonomous vehicles | en_US |
| dc.subject | On-demand feeder transit | en_US |
| dc.subject | Optimal design | en_US |
| dc.title | Optimal design of on-demand modular feeder transit services | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 178 | en_US |
| dc.identifier.doi | 10.1016/j.trc.2025.105245 | en_US |
| dcterms.abstract | Modular Autonomous Vehicles (MAVs) enable transit agencies to adapt to fluctuating demand by flexibly coupling them into platoons for dispatch. We propose decoupling these platoons into individual MAVs for on-demand feeder transit, which connects a transportation hub and offers door-to-door services to patrons across a distant region. This Modular Feeder Transit (MFT) reduces routing distance and time to visit multiple points within the service region, traditionally accomplished by a single bus vehicle but now by several MAVs, each covering a subset of the total points. However, careful consideration is needed for recoupling MAVs on return trips, as delays may arise from waiting for the last MAV. To assess MFT’s effectiveness, we propose an optimal design model to determine key operational features for MFT such as platoon sizes at dispatch, dispatch headways, zone partitions, and recoupling strategies, tailored to non-uniform demand distributions. Using continuum approximation, we derive analytical expressions for system metrics, including routing time, waiting time, line-haul travel time, and operational costs. Closed-form relationships for optimal conditions lead to an efficient solution algorithm. Numerical studies show that MFT consistently outperforms traditional fixed-capacity feeder bus transit, achieving over 10% cost savings in certain scenarios. Notably, the advantage of MFT diminishes with high routing time variance. This underscores the necessity of advanced operational algorithms to reduce MAV trip variance and leverage the flexibility of MAVs in practice. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Transportation Research Part C: Emerging Technologies, Sept 2025, v. 178, 105245 | en_US |
| dcterms.isPartOf | Transportation research. Part C, Emerging technologies | en_US |
| dcterms.issued | 2025-09 | - |
| dc.identifier.scopus | 2-s2.0-105009797521 | - |
| dc.identifier.eissn | 1879-2359 | en_US |
| dc.identifier.artn | 105245 | en_US |
| dc.description.validate | 202510 bcch | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G000235/2025-07 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | The first author is supported by the China Postdoctoral Science Foundation (2024MD764029); the second author receives support from the Start-up Fund of Hong Kong Polytechnic University; and the first and third authors are funded by the National Natural Science Foundation of China (72091513, 52472321). We appreciate the editor and two anonymous reviewers for their valuable comments, which helped improve this paper. | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2027-09-30 | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



