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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A milk collection problem with blending




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    A milk collection problem with blending

    Paredes-Belmar, Germán / Marianov, Vladimir / Bronfman, Andrés et al. | Elsevier | 2016



    Brake Blending

    Leigh, M. J. / IMechE; Railway Division | British Library Conference Proceedings | 1994


    Brake blending

    Leigh, M.J. | Online Contents | 1994


    Blending In

    Online Contents | 2013