A milk collection problem with blending
| Autor: | Andrés Bronfman, Vladimir Marianov, Carlos Obreque, Germán Paredes-Belmar, Armin Lüer-Villagra |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Truck
0209 industrial biotechnology Engineering 021103 operations research Operations research business.industry 0211 other engineering and technologies Transportation 02 engineering and technology Profit (economics) 020901 industrial engineering & automation Revenue Operations management Business and International Management business Integer programming Civil and Structural Engineering |
| Zdroj: | Transportation Research Part E: Logistics and Transportation Review. 94:26-43 |
| ISSN: | 1366-5545 |
| DOI: | 10.1016/j.tre.2016.07.006 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect