Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/103004
Title: Optimal capacity allocation for high-speed railway express delivery
Authors: Xu, G
Guo, J
Zhong, L
Zhang, F
Liu, W 
Issue Date: Nov-2023
Source: Computers and industrial engineering, Nov. 2023, v. 185, 109683
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.
Keywords: Capacity allocation
Delivery time window
Express delivery
High-speed railway
Stochastic demand
Publisher: Elsevier Ltd
Journal: Computers and industrial engineering 
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2023.109683
Appears in Collections:Journal/Magazine Article

Open Access Information
Status embargoed access
Embargo End Date 2026-11-30
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

138
Last Week
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.