Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/115715
DC FieldValueLanguage
dc.contributorDepartment of Aeronautical and Aviation Engineeringen_US
dc.creatorHe, Qen_US
dc.creatorLiu, Wen_US
dc.creatorXi, Hen_US
dc.date.accessioned2025-10-23T08:18:56Z-
dc.date.available2025-10-23T08:18:56Z-
dc.identifier.issn0191-2615en_US
dc.identifier.urihttp://hdl.handle.net/10397/115715-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.subjectBranch-and-price-and-cut (B&P&C) algorithmen_US
dc.subjectDynamic electric vehicle fleets managementen_US
dc.subjectMulti-service ride-hailing platformsen_US
dc.subjectVehicle-to-grid (V2G)en_US
dc.titleDynamic electric vehicle fleets management problem for multi-service platforms with integrated ride-hailing, on-time delivery, and vehicle-to-grid servicesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume199en_US
dc.identifier.doi10.1016/j.trb.2025.103281en_US
dcterms.abstractThe rapid adoption of electric vehicles (EVs) and the surge in mobility service demand necessitate efficient management of EV fleets. In practice, these vehicles often remain idle for extended periods due to fluctuating demand, leading to underutilized resources and lost revenue. In response, this paper investigates a dynamic multi-service platform that concurrently coordinates ride-hailing, on-time delivery, and vehicle-to-grid (V2G) energy services. By leveraging synergies across these services, the proposed coordination strategy improves resource utilization, reduces operational costs, and increases profitability. Upon accessing the platform, users submit various service requests that specify the origin, destination, time windows, and either the number of riders or the weight of goods. To meet these heterogeneous, real-time demands, we propose a dynamic multi-service electric vehicle fleet management (MEFM) problem to optimize the allocation, routing, and scheduling of EV fleets to maximize platform profits over each time period. We formulate the proposed MEFM problem as an arc-based mixed-integer linear programming (MILP) model and develop a customized branch-and-price-and-cut (B&P&C) algorithm for its efficient solution. Our algorithm integrates Dantzig–Wolfe decomposition, improved with subset row cuts, and a novel labeling sub-algorithm that effectively captures multi-service coordination, fleet capacity, and battery-level constraints under partial recharging flexibility. Extensive numerical experiments based on a case study in the context of Shenzhen, China, demonstrate that the customized B&P&C algorithm achieves computation speeds on average 150.99 times faster than the state-of-the-art commercial solver (Gurobi), with speed-ups ranging from 3.33 to 477.42 times, while consistently obtaining optimal solutions for large-scale instances where Gurobi fails. Moreover, our results highlight the benefits of integrating on-time delivery and V2G energy services, e.g., despite a modest increase in operational costs, the substantial rise in profits validates the economic potential of the multi-service platforms. We also identify that partial recharging flexibility for EVs further reduces delay costs by up to 70.27% and boosts overall profits by up to 40.90%.en_US
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationTransportation research. Part B, Methodological, Sept. 2025, v. 199, 103281en_US
dcterms.isPartOfTransportation Research Part B: Methodologicalen_US
dcterms.issued2025-09-
dc.identifier.scopus2-s2.0-105010951815-
dc.identifier.eissn1879-2367en_US
dc.identifier.artn103281en_US
dc.description.validate202510 bcwcen_US
dc.description.oaNot applicableen_US
dc.identifier.SubFormIDG000248/2025-08-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThe authors would like to thank the anonymous referees for their useful comments, which helped improve both the technical quality and exposition of this paper. This research was partly supported by Guangdong Basic and Applied Basic Research Fund, Hong Kong Special Administrative Region of China (No. 2023A1515012266), National Natural Science Foundation of China (No. 72301228), and the Research Grants Council of Hong Kong (PolyU15204623).en_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2027-09-30en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2027-09-30
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.