Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/113367
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | Wang, X | en_US |
dc.creator | Zhen, L | en_US |
dc.creator | Wang, S | en_US |
dc.date.accessioned | 2025-06-03T01:37:23Z | - |
dc.date.available | 2025-06-03T01:37:23Z | - |
dc.identifier.issn | 0967-070X | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/113367 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Ltd | en_US |
dc.subject | Crowdsourced delivery | en_US |
dc.subject | Freight allocation and crowd routing | en_US |
dc.subject | High-speed railway express delivery | en_US |
dc.subject | Transshipment | en_US |
dc.title | Optimizing an express delivery mode based on high-speed railway and crowd-couriers | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 157 | en_US |
dc.identifier.epage | 177 | en_US |
dc.identifier.volume | 159 | en_US |
dc.identifier.doi | 10.1016/j.tranpol.2024.10.009 | en_US |
dcterms.abstract | The rapid development of e-commerce has led to various challenges in the express delivery industry. To provide efficient and economical delivery services, this study introduces a joint transportation system for parcel delivery utilizing high-speed railway (HSR) and crowd-couriers. In this system, long-haul transportation between cities is conducted by HSR, which enables multiple transshipments in different operation lines. The pre-haul parcel pickup and end-haul delivery services within the city are performed by crowd-couriers, thus achieving door-to-door transportation. A mathematical model is developed to jointly optimize the freight allocation problem in the rail segment and the crowd-courier routing problem in the road segment. The freight allocation problem is formulated based on the concept of transportation plans. The transportation plans with and without transshipments are found by a depth-first search-based algorithm in the rail segment. A customized heuristic algorithm based on the adaptive large neighborhood search with multiple operators is designed to find a near-optimal solution. A set of numerical experiments demonstrates the speed and accuracy with which the proposed method solves different-sized versions of problem. A sensitivity analysis based on a real HSR network is also conducted to provide more reliable managerial insights for operators. | en_US |
dcterms.accessRights | embargoed access | en_US |
dcterms.bibliographicCitation | Transport policy, Dec. 2024, v. 159, p. 157-177 | en_US |
dcterms.isPartOf | Transport policy | en_US |
dcterms.issued | 2024-12 | - |
dc.identifier.eissn | 1879-310X | en_US |
dc.description.validate | 202506 bcch | en_US |
dc.description.oa | Not applicable | en_US |
dc.identifier.FolderNumber | a3627 | - |
dc.identifier.SubFormID | 50505 | - |
dc.description.fundingSource | Self-funded | en_US |
dc.description.pubStatus | Published | en_US |
dc.date.embargo | 2026-12-31 | 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.