A multi-objective approach for supporting wine grape harvest operations

•We present a multi-objective MIP to support wine grape harvest.•We propose a negotiation protocol to ease an agreement between two decision-makers.•Our approach draws from the augmented e-constraint method.•We suggest a substitution rate criteria to chose which solution to present.•The protocol mig...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering Jg. 145; S. 106497
Hauptverfasser: Varas, Mauricio, Basso, Franco, Maturana, Sergio, Osorio, David, Pezoa, Raúl
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.07.2020
Schlagworte:
Grape harvest
Interactive methods
Multi-objective optimization
Wine industry
Interactive methods
Grape harvest
Wine industry
Multi-objective optimization
ISSN:0360-8352, 1879-0550
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We present a multi-objective MIP to support wine grape harvest.•We propose a negotiation protocol to ease an agreement between two decision-makers.•Our approach draws from the augmented e-constraint method.•We suggest a substitution rate criteria to chose which solution to present.•The protocol might be extended to other contexts with two decision-makers. In this paper, we present a novel multi-objective mixed-integer linear programming model to support wine grape harvesting. The proposed model considers the opposing nature of operational cost minimization and grape quality maximization, subject to several constraints, such as grape requirements and routing decisions. Based on the operations of a winery we worked with, we develop a negotiation protocol that can lead to an agreed final harvest schedule. The protocol includes an initial Pareto optimal solution obtained through the augmented weighted Tchebycheff method. Then, the solutions are presented to the two decision-makers and, if no agreement is reached, we conduct an iterative process, which includes finding Pareto optimal solutions in a neighborhood using the augmented ∊-constraint method. Finally, we choose, within this set, the solution following a substitution rate criteria. We illustrate our procedure using an educational example.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2020.106497