A stochastic dairy transportation problem considering collection and delivery phases
檔案
本條目沒有附加檔案。
日期
2019-09-01
類型
期刊名稱
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷期與頁次
第 129 卷,頁 325–338
ISSN
1366-5545
語言
英文
摘要
Based on the dairy cooperatives in Indonesia, this study formulates a stochastic programming model to handle the milk collection and delivery process with the maximum route duration limitation, the external cooling facility option, and travel time uncertainty. Besides, the local practice of sharing the fleet for both collection and delivery further complicates the decision. A set covering-based solution approach is used, due to its flexibility in handling complicated operational requirements and alignment with the decision environment. According to the numerical experiment, the proposed solution algorithm can provide quality solutions with a reasonable computational time for the cooperative operators.
關鍵詞
Dairy transportation problemInteger programmingVehicle routingTravel time uncertaintySet covering problem所屬典藏
期刊論文引用此條目
Huang, K., Wu, K.-F., & Ardiansyah, M. N. (2019). A stochastic dairy transportation problem considering collection and delivery phases. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 129, 325–338. https://doi.org/10.1016/j.tre.2018.01.018
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/153093