The milk collection problem with blending and collection points

Germán Paredes-Belmar, Armin Lüer-Villagra, Vladimir Marianov, Cristián E. Cortés, Andrés Bronfman

Resultado de la investigación: Contribución a la publicaciónArticle

Resumen

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.

Idioma originalEnglish
Páginas (desde - hasta)109-123
Número de páginas15
PublicaciónComputers and Electronics in Agriculture
Volumen134
Identificadores de objetos digitales
EstadoPublished - 1 mar 2017

Huella dactilar

milk
farm
Farms
heuristics
Dairies
Integer programming
Trucks

Keywords

    ASJC Scopus subject areas

    • Forestry
    • Animal Science and Zoology
    • Agronomy and Crop Science
    • Computer Science Applications
    • Horticulture

    Citar esto

    Paredes-Belmar, Germán; Lüer-Villagra, Armin; Marianov, Vladimir; Cortés, Cristián E.; Bronfman, Andrés / The milk collection problem with blending and collection points.

    En: Computers and Electronics in Agriculture, Vol. 134, 01.03.2017, p. 109-123.

    Resultado de la investigación: Contribución a la publicaciónArticle

    @article{f909c81bb42043d79b654752f787a1bc,
    title = "The milk collection problem with blending and collection points",
    abstract = "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.",
    keywords = "Heuristic, Location-routing-allocation problem, Milk collection",
    author = "Germán Paredes-Belmar and Armin Lüer-Villagra and Vladimir Marianov and Cortés, {Cristián E.} and Andrés Bronfman",
    year = "2017",
    month = "3",
    doi = "10.1016/j.compag.2017.01.015",
    volume = "134",
    pages = "109--123",
    journal = "Computers and Electronics in Agriculture",
    issn = "0168-1699",
    publisher = "Elsevier",

    }

    The milk collection problem with blending and collection points. / Paredes-Belmar, Germán; Lüer-Villagra, Armin; Marianov, Vladimir; Cortés, Cristián E.; Bronfman, Andrés.

    En: Computers and Electronics in Agriculture, Vol. 134, 01.03.2017, p. 109-123.

    Resultado de la investigación: Contribución a la publicaciónArticle

    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

    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

    VL - 134

    SP - 109

    EP - 123

    JO - Computers and Electronics in Agriculture

    T2 - Computers and Electronics in Agriculture

    JF - Computers and Electronics in Agriculture

    SN - 0168-1699

    ER -