Purchase and Production Optimization in a Meat Processing Plant

• URL: http://arxiv.org/abs/2507.15866v1
• Date: Mon, 14 Jul 2025 11:05:46 GMT
• Title: Purchase and Production Optimization in a Meat Processing Plant
• Authors: Marek Vlk, Premysl Sucha, Jaroslaw Rudy, Radoslaw Idzikowski,
• Abstract summary: This paper addresses an optimization problem concerning the purchase and subsequent material processing.<n>We design a simple iterative approach based on integer linear programming that allows us to solve real-life instances.<n>The results obtained using real data from the meat processing company showed that our algorithm can find the optimum solution in a few seconds.
• Score: 0.9074663948713615
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The food production industry, especially the meat production sector, faces many challenges that have even escalated due to the recent outbreak of the energy crisis in the European Union. Therefore, efficient use of input materials is an essential aspect affecting the profit of such companies. This paper addresses an optimization problem concerning the purchase and subsequent material processing we solved for a meat processing company. Unlike the majority of existing papers, we do not concentrate on how this problem concerns supply chain management, but we focus purely on the production stage. The problem involves the concept of alternative ways of material processing, stock of material with different expiration dates, and extra constraints widely neglected in the current literature, namely, the minimum order quantity and the minimum percentage in alternatives. We prove that each of these two constraints makes the problem \mbox{$\mathcal{NP}$-hard}, and hence we design a simple iterative approach based on integer linear programming that allows us to solve real-life instances even using an open-source integer linear programming solver. Another advantage of this approach is that it mitigates numerical issues, caused by the extensive range of data values, we experienced with a commercial solver. The results obtained using real data from the meat processing company showed that our algorithm can find the optimum solution in a few seconds for all considered use cases.

Related papers

• Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model [6.123324869194196]
  We study the assortment optimization problem under the mixed-logit customer choice model. Existing exact methods have primarily relied on mixed-integer linear programming (MILP) or second-order cone (CONIC) reformulations. Our work addresses the problem by focusing on components of the objective function that can be proven to be monotonically super-modular and convex.
  arXiv  Detail & Related papers  (2024-07-26T06:27:11Z)
• Identifying contributors to supply chain outcomes in a multi-echelon setting: a decentralised approach [47.00450933765504]
  We propose the use of explainable artificial intelligence for decentralised computing of estimated contributions to a metric of interest. This approach mitigates the need to convince supply chain actors to share data, as all computations occur in a decentralised manner. Results demonstrate the effectiveness of our approach in detecting the source of quality variations compared to a centralised approach.
  arXiv  Detail & Related papers  (2023-07-22T20:03:16Z)
• Large Language Models for Supply Chain Optimization [4.554094815136834]
  We study how Large Language Models (LLMs) can help bridge the gap between supply chain automation and human comprehension and trust thereof. We design OptiGuide -- a framework that accepts as input queries in plain text, and outputs insights about the underlying outcomes. We demonstrate the effectiveness of our framework on a real server placement scenario within Microsoft's cloud supply chain.
  arXiv  Detail & Related papers  (2023-07-08T01:42:22Z)
• Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets [86.43523688236077]
  Combinatorial optimization (CO) problems are often NP-hard and out of reach for exact algorithms. GFlowNets have emerged as a powerful machinery to efficiently sample from composite unnormalized densities sequentially. In this paper, we design Markov decision processes (MDPs) for different problems and propose to train conditional GFlowNets to sample from the solution space.
  arXiv  Detail & Related papers  (2023-05-26T15:13:09Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Comparing Heuristics, Constraint Optimization, and Reinforcement Learning for an Industrial 2D Packing Problem [58.720142291102135]
  Cutting and Packing problems are occurring in different industries with a direct impact on the revenue of businesses. Machine learning is increasingly used for solving such problems.
  arXiv  Detail & Related papers  (2021-10-27T15:47:47Z)
• Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems [14.352521012951865]
  The goal of blending material from stockpiles is to create parcels of concentrate which contain optimal metal grades. The volume of material that each stockpile provides to a given parcel is dependent on a set of mine schedule conditions and customer demands. We introduce two repaired operators for the problems to convert the infeasible solutions into the solutions without violating the two tight constraints.
  arXiv  Detail & Related papers  (2021-04-08T00:22:39Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• Marketing Mix Optimization with Practical Constraints [0.0]
  We address a variant of the marketing mix optimization (MMO) problem which is commonly encountered in many industries. Given the size of a realistic problem in the industrial setting, the state-of-the-art integer programming solvers may not be able to solve the problem to optimality. We propose a systematic reformulation to ease the computational burden.
  arXiv  Detail & Related papers  (2021-01-11T02:10:19Z)
• A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit [2.9998316151418107]
  We consider a dynamic set optimization problem, where a decision-maker offers a subset of products to a consumer. We model consumer choice behavior using the widely used Multinomial Logit (MNL) model. We show that the regret is bounded by $O(sqrtdT + kappa)$, significantly improving the performance over existing methods.
  arXiv  Detail & Related papers  (2020-11-28T00:20:36Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.