A stochastic dairy transportation problem considering collection and delivery phases

Kuan-cheng Huang*, Kun-Feng Wu, Muhammad Nashir Ardiansyah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


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.

Original languageEnglish
Pages (from-to)325-338
Number of pages14
JournalTransportation Research Part E: Logistics and Transportation Review
StatePublished - Sep 2019


  • Dairy transportation problem
  • Integer programming
  • Set covering problem
  • Travel time uncertainty
  • Vehicle routing


Dive into the research topics of 'A stochastic dairy transportation problem considering collection and delivery phases'. Together they form a unique fingerprint.

Cite this