Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 69, Issue -, Pages 108-121Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2014.05.018
Keywords
Consolidation; Perishable products; Stochastic dynamic programming; Cost allocation; Freight transportation
Categories
Funding
- National Science Foundation [CMMI-1265616]
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1265616] Funding Source: National Science Foundation
Ask authors/readers for more resources
A set of agricultural suppliers with low demands can save on long-haul transportation costs by consolidating their product. We consider a system with stochastic demand and a single consolidation point near the suppliers. We propose a look-ahead heuristic that takes advantage of economies of scale by aiming to ship larger quantities. We experimentally compare the heuristic's performance against other simple policies, a rolling horizon algorithm, and a stochastic dynamic programming model. Our numerical results demonstrate that the heuristic provides solutions that are near the lower bound provided by the dynamic programming model, and that the benefits of consolidating depend on the size of the suppliers' demand. We also propose a proportional cost allocation rule that encourages the suppliers to cooperate with each other instead of operating independently. (C) 2014 Elsevier Ltd. All rights reserved.
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