A milk collection problem with blending
Cargando...
Archivos
Fecha
2016-10
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier Ltd
Nombre de Curso
Licencia CC
Atribución 4.0 Internacional (CC BY 4.0)
Licencia CC
https://creativecommons.org/licenses/by/4.0/deed.es
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. © 2016 Elsevier Ltd
Notas
Indexación: Scopus
Palabras clave
Different qualities of milk, Milk collection, Routing
Citación
DOI
10.1016/j.tre.2016.07.006