SearcharxivSearch

arXiv · 2405.19997

Analyzing the impact of forecast errors in the planning of wine grape harvesting operations using a multi-stage stochastic model approach

Abstract

Forecasts and future beliefs play a critical role in the harvest labor hiring planning, especially when errors in them entails fixing previous made decisions, which can carry extra costs or losses. In this article, we study the effect that errors in the forecast/belief can have in the wine grape harvest planning process and the losses of the product. Errors are reflected in the prediction of yields and in the estimation of rain transition probabilities have on the value and losses of product. Also, using a multi-stage stochastic optimization model we can study the effect that second stage decisions have on the ability fix the planning decisions, reduce product losses and generate value. In a first step, we develop a multi-stage stochastic model which considers grape growth uncertainty given a belief in future events. The model decisions variables are: hiring, firing and maintaining harvest labor through periods, and also the harvested quantities in each period and block. Once the model defines the plan for the coming epoch, some decisions are implemented and a deviation in the forecast is revealed and the decision maker can adjust future decisions and beliefs. Results indicate that the effect of the errors in yield determination is not symmetrical; underestimations of the yields have a more significant negative effect on the objective function, while overestimation does not. Flexibility to revise hiring decisions does not make a significant difference if the yields are overestimated. The model significantly reduces losses of the better-quality grapes, since they correspond to a significant proportion of the income and account for the largest portion of income loss. Last, grapes that have an early improvement of their quality give the decision-maker an extra level of flexibility to adjust the harvesting plan.

Explore related subjects

Keep this discovery

BibTeXRIS

Alejandro Milani, Alejandro Mac Cawley. 2024-05-30. Analyzing the impact of forecast errors in the planning of wine grape harvesting operations using a multi-stage stochastic model approach. https://arxiv.org/abs/2405.19997

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC