Constrained global optimization for wine blending - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Constraints Year : 2016

Constrained global optimization for wine blending

Abstract

Assemblage consists in blending base wines in order to create target wines. Recent developments in aroma analysis allow us to measure chemical compounds impacting the taste of wines. This chemical analysis makes it possible to design a decision tool for the following problem: given a set of target wines, determine which volumes must be extracted from each base wine to produce wines that satisfy constraints on aroma concentration, volumes, alcohol contents and price. This paper describes the modeling of wine assemblage as a mixed constrained optimization problem, where the main goal is to minimize the gap to the desired concentrations for every aromatic criterion. The deterministic branch and bound solvers Couenne and IbexOpt behave well on the wine blending problem thanks to their interval constraint propagation/programming and polyhedral relaxation methods. We also study the performance of other optimization goals that could be embedded in a configuration tool, where the different possible interactions amount to solving the same constraints with different objective functions. We finally show on a recent generic wine blending instance that the proposed optimization process scales up well with the number of base wines.
Fichier principal
Vignette du fichier
wineblending_constraints_2016.pdf (734.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01275597 , version 1 (18-10-2018)

Identifiers

Cite

Philippe Vismara, Remi Coletta, Gilles Trombettoni. Constrained global optimization for wine blending. Constraints, 2016, 21 (4), pp.597-615. ⟨10.1007/s10601-015-9235-5⟩. ⟨lirmm-01275597⟩
168 View
254 Download

Altmetric

Share

Gmail Facebook X LinkedIn More