A milk collection problem with blending

Germán Paredes-Belmar, Vladimir Marianov, Andrés Bronfman, Carlos Obreque, Armin Lüer-Villagra

Research output: Contribution to journalArticlepeer-review

32 Citations (Scopus)


A milk collection problem with blending is introduced. A firm collects milk from farms, and each farm produces one out of three possible qualities of milk. The revenue increases with quality, and there is a minimum requirement at the plant for each quality. Different qualities of milk can be blended in the trucks, reducing revenues, but also transportation costs, resulting in higher profit. A mixed integer-programming model, a new cut, and a branch-and-cut algorithm are proposed to solve medium-sized instances. A three-stage heuristic is designed for large instances. Computational experience for test instances and a large-sized real case is presented.

Original languageEnglish
Pages (from-to)26-43
Number of pages18
JournalTransportation Research Part E: Logistics and Transportation Review
Publication statusPublished - 1 Oct 2016


  • Different qualities of milk
  • Milk collection
  • Routing

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation


Dive into the research topics of 'A milk collection problem with blending'. Together they form a unique fingerprint.

Cite this