A milk collection problem with blending

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

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

  • 1 Citas

Resumen

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.

Idioma originalEnglish
Páginas (desde - hasta)26-43
Número de páginas18
PublicaciónTransportation Research Part E: Logistics and Transportation Review
Volumen94
Identificadores de objetos digitales
EstadoPublished - 1 oct 2016

Huella dactilar

Milk
Farm
Revenue
Farms
Heuristics
Profit
Integer programming
Trucks
Profitability
Costs

Keywords

    ASJC Scopus subject areas

    • Business and International Management
    • Transportation
    • Management Science and Operations Research

    Citar esto

    Paredes-Belmar, Germán; Marianov, Vladimir; Bronfman, Andrés; Obreque, Carlos; Lüer-Villagra, Armin / A milk collection problem with blending.

    En: Transportation Research Part E: Logistics and Transportation Review, Vol. 94, 01.10.2016, p. 26-43.

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

    @article{723bf7a1a99a4a73a488056dd9be5456,
    title = "A milk collection problem with blending",
    abstract = "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.",
    keywords = "Different qualities of milk, Milk collection, Routing",
    author = "Germán Paredes-Belmar and Vladimir Marianov and Andrés Bronfman and Carlos Obreque and Armin Lüer-Villagra",
    year = "2016",
    month = "10",
    doi = "10.1016/j.tre.2016.07.006",
    volume = "94",
    pages = "26--43",
    journal = "Transportation Research, Part E: Logistics and Transportation Review",
    issn = "1366-5545",
    publisher = "Elsevier Limited",

    }

    A milk collection problem with blending. / Paredes-Belmar, Germán; Marianov, Vladimir; Bronfman, Andrés; Obreque, Carlos; Lüer-Villagra, Armin.

    En: Transportation Research Part E: Logistics and Transportation Review, Vol. 94, 01.10.2016, p. 26-43.

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

    TY - JOUR

    T1 - A milk collection problem with blending

    AU - Paredes-Belmar,Germán

    AU - Marianov,Vladimir

    AU - Bronfman,Andrés

    AU - Obreque,Carlos

    AU - Lüer-Villagra,Armin

    PY - 2016/10/1

    Y1 - 2016/10/1

    N2 - 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.

    AB - 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.

    KW - Different qualities of milk

    KW - Milk collection

    KW - Routing

    UR - http://www.scopus.com/inward/record.url?scp=84980349702&partnerID=8YFLogxK

    U2 - 10.1016/j.tre.2016.07.006

    DO - 10.1016/j.tre.2016.07.006

    M3 - Article

    VL - 94

    SP - 26

    EP - 43

    JO - Transportation Research, Part E: Logistics and Transportation Review

    T2 - Transportation Research, Part E: Logistics and Transportation Review

    JF - Transportation Research, Part E: Logistics and Transportation Review

    SN - 1366-5545

    ER -