Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 122, Issue -, Pages 309-327Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2018.12.011
Keywords
Last-mile split delivery; Shipment consolidation; Online retailing; Piecewise-integer structure; Breadth-first search algorithm
Categories
Funding
- National Natural Science Foundation of China (NSFC) [71571067, 71571027]
- NSFC [71531002, 71421001]
- China Scholarship Council [201706060098, 201806065010]
Ask authors/readers for more resources
This paper addresses the last-mile split delivery problem emerging in online retailing, in which multiple shipments are delivered to the same customer multiple times. We propose an innovative order consolidation approach which consolidates same customers' shipments in the delivery station and delivers them in fewer trips. An integer programming model is formulated to make a cost tradeoff between splitting and consolidating shipments, which is solved by a new three-phase heuristic algorithm. Numerical experiments are conducted to demonstrate the superiority of the order consolidation approach over the First-In-First-Out approach on various parameters and generate managerial insights for applying it in practice.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available