Abstract: Genetic algorithms have proved to be a useful improvement heuristic for tackling several combinatorial problems, including the coalition structure generation problem. In this case, the focus lies on selecting the best partition from a discrete set. A relevant issue when designing a Genetic algorithm for coalition structure generation problems is to choose a proper genetic encoding that enables an efficient computational implementation. In this paper, we present a novel hybrid encoding, and we compare its performance against several genetic encoding proposed in the literature. We show that even in difficult instances of the coalition structure generation problem, the proposed approach is a competitive alternative to obtaining good quality solutions in reasonable computing times. Furthermore, we also show that the encoding relevance increases as the number of players increases.

Abstract: Horizontal collaboration is a strategy that has increasingly been used for improving supply chain operations. In this paper, we analyze the benefits of using a collaborative approach when optimally planning the wine grape harvesting process. Particularly, we assess how labor and machinery collaborative planning impacts harvesting costs. We model cooperation among wineries as a coalitional game with transferable costs for which the characteristic function vector is computed by solving a new formulation for planning the wine grape harvesting. In order to obtain stable coalitions, we devise an optimization problem that incorporates both rationality and efficiency conditions and uses the Gini index as a fairness criterion. Focusing on an illustrative case, we develop several computational experiments that show the positive effect of collaboration in the harvesting process. Moreover, our computational results reveal that the results depend strongly on the fairness criteria used. The Gini index, for example, favors the formation of smaller coalitions compared to other fairness criteria such as entropy.