Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/103004
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Aeronautical and Aviation Engineering | en_US |
| dc.creator | Xu, G | en_US |
| dc.creator | Guo, J | en_US |
| dc.creator | Zhong, L | en_US |
| dc.creator | Zhang, F | en_US |
| dc.creator | Liu, W | en_US |
| dc.date.accessioned | 2023-11-20T03:47:06Z | - |
| dc.date.available | 2023-11-20T03:47:06Z | - |
| dc.identifier.citation | v. 185, 109683 | - |
| dc.identifier.issn | 0360-8352 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/103004 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier Ltd | en_US |
| dc.subject | Capacity allocation | en_US |
| dc.subject | Delivery time window | en_US |
| dc.subject | Express delivery | en_US |
| dc.subject | High-speed railway | en_US |
| dc.subject | Stochastic demand | en_US |
| dc.title | Optimal capacity allocation for high-speed railway express delivery | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 185 | en_US |
| dc.identifier.doi | 10.1016/j.cie.2023.109683 | en_US |
| dcterms.abstract | This study investigates the potential of implementing express delivery services within specified time windows on the high-speed railway (HSR) and optimizes the train capacity allocation scheme for HSR express delivery (HSReD). We first propose an integer linear programming (ILP) model for the deterministic demand case to maximize the profit of the HSReD operation (revenue minus transportation cost, loading/unloading costs, and the penalty incurred due to schedule delays). Then, a two-stage stochastic programming model is developed to account for the stochastic demand case, with the objective of maximizing the expected profit. To facilitate the solution process, the two-stage stochastic programming model is transformed into an equivalent nonlinear model, which is further reformulated into an equivalent integer linear programming (EILP) model that can be solved by commercial solvers. Finally, the proposed method is applied on a small toy network, Nanjing-Hangzhou HSR network and Beijing-Shanghai HSR network to illustrate its efficacy. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Computers and industrial engineering, Nov. 2023, v. 185, 109683 | en_US |
| dcterms.isPartOf | Computers and industrial engineering | en_US |
| dcterms.issued | 2023-11 | - |
| dc.identifier.eissn | 1879-0550 | en_US |
| dc.identifier.artn | 109683 | en_US |
| dc.description.validate | 202311 bcch | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.FolderNumber | a2514 | - |
| dc.identifier.SubFormID | 47804 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | National Natural Science Foundation of China; Natural Science Foundation of Hunan Province; The Hong Kong Polytechnic University | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2026-11-30 | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Page views
138
Last Week
3
3
Last month
Citations as of Nov 9, 2025
SCOPUSTM
Citations
1
Citations as of Jun 21, 2024
WEB OF SCIENCETM
Citations
9
Citations as of Dec 18, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



