TY - JOUR
T1 - The milk collection problem with blending and collection points
AU - Paredes-Belmar, Germán
AU - Lüer-Villagra, Armin
AU - Marianov, Vladimir
AU - Cortés, Cristián E.
AU - Bronfman, Andrés
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2017/3/1
Y1 - 2017/3/1
N2 - A novel problem for the collection of raw milk from a network of farms supplying a dairy is specified and solved. The proposed approach incorporates milk blending and the delivery of production to collection points by small, distant farms. The milk is collected by, and blended in, a homogeneous fleet of trucks and classified according to the lowest quality product included in the blend. Optimization criteria are used to determine where the collection points should be located and which producers are allocated to them for delivery, with all other production picked up directly at the farms. The approach is built around an integer programming model and two implementation strategies, one using a branch-and-cut algorithm for small instances and the other a heuristic procedure combining both exact and approximated methods to handle large instances within a reasonable computation time. A real case study involving 500 farms and 112 possible collection points is solved and the results compared. The impact on the solutions of dividing the real instance into zones is also explored.
AB - A novel problem for the collection of raw milk from a network of farms supplying a dairy is specified and solved. The proposed approach incorporates milk blending and the delivery of production to collection points by small, distant farms. The milk is collected by, and blended in, a homogeneous fleet of trucks and classified according to the lowest quality product included in the blend. Optimization criteria are used to determine where the collection points should be located and which producers are allocated to them for delivery, with all other production picked up directly at the farms. The approach is built around an integer programming model and two implementation strategies, one using a branch-and-cut algorithm for small instances and the other a heuristic procedure combining both exact and approximated methods to handle large instances within a reasonable computation time. A real case study involving 500 farms and 112 possible collection points is solved and the results compared. The impact on the solutions of dividing the real instance into zones is also explored.
KW - Heuristic
KW - Location-routing-allocation problem
KW - Milk collection
UR - http://www.scopus.com/inward/record.url?scp=85010840247&partnerID=8YFLogxK
U2 - 10.1016/j.compag.2017.01.015
DO - 10.1016/j.compag.2017.01.015
M3 - Article
AN - SCOPUS:85010840247
SN - 0168-1699
VL - 134
SP - 109
EP - 123
JO - Computers and Electronics in Agriculture
JF - Computers and Electronics in Agriculture
ER -