Application of the knapsack problem for the logistic optimization of truck loading: a case study in a dairy company
Application of the knapsack problem for the logistic optimization of truck loading: a case study in a dairy company
DOI:
https://doi.org/10.56643/rcia.v5i1.232Keywords:
Dynamic programming, knapsack problem, utility maximization, logistics, dairy companyAbstract
The efficient distribution of perishable products represents a critical challenge in the dairy industry, where maximizing profit per truck and reducing operating costs are essential. This study implements a dynamic programming (DP) model to solve a knapsack problem applied to the urban logistics of a dairy company. A multistage algorithm was developed to determine the optimal combination of five dairy products for a truck with a maximum capacity of 3,881 kg. The results show that the optimal load achieves a total profit of 105 MXN through the strategic exclusion of lower-margin products, while scenarios with lower capacity (3,000 kg) reduce profit to 85 MXN and higher capacities (4,200 kg) yield only a slight increase to 110 MXN. These results make it possible to identify economically efficient capacity levels and priority products for loading, providing a quantitative criterion for operational decision-making in urban transport planning. The methodology allows the simulation of different capacity and demand scenarios, demonstrating flexibility, reproducibility, and efficiency; highlighting the practical applicability of dynamic programming in the logistics optimization of perishable products.
References
Ahumada, O., y Villalobos, J. R. (2009). Application of planning models in the agri-food supply chain: A review. European Journal of Operational Research, 196(1), 1-20. https://doi.org/10.1016/j.ejor.2008.02.014
Heizer, J., Render, B., y Munson, C. (2017). Principles of Operations Management (10th ed.). Pearson.
Hillier, F. S., y Lieberman, G. J. (2021). Introducción a la investigación de operaciones. McGraw-Hill.
Jacko, P. (2016). Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic. Annals of Operations Research, 241(1-2), 83-107. https://doi.org/10.1007/s10479-013-1312-9
Kashyap, A., Shukla, O. J., Jha, B. K., Ramtiyal, B., y Soni, G. (2023). Enhancing Sustainable Dairy Industry Growth through Cold-Supply-Chain-Integrated Production Forecasting. Sustainability, 15(22), 16102. https://doi.org/10.3390/su152216102
Li, Y., Chu, F., Côté, J.-F., Coelho, L. C., y Chu, C. (2020). The multi-plant perishable food production routing with packaging consideration. International Journal of Production Economics, 221, 107472. https://doi.org/10.1016/j.ijpe.2019.08.007
Martello, S., y Toth, P. (1990). Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc.
Ndraha, N., Hsiao, H.-I., Vlajic, J., Yang, M.-F., y Lin, H.-T. V. (2018). Time-temperature abuse in the food cold chain: Review of issues, challenges, and recommendations. Food Control, 89, 12-21. https://doi.org/10.1016/j.foodcont.2018.01.027
Rinaldi, M., Bottani, E., Solari, F., y Montanari, R. (2020). The milk collection problem with time constraint: an optimization study integrating simulation. Proceedings of the International Food Operations and Processing Simulation Workshop (pp. 7-13). https://doi.org/10.46354/i3m.2020.foodops.002
Taha, H. A. (2020). Operations Research: An Introduction (10th ed.). Pearson.
Zhong, X., Wen, Z., Wei, L., Xu, W., Zhang, Y., Yu, L., y Xue, L. (2022). Analysis of Influencing Factors of Cold Chain Logistics Cost of Dairy Products. Industrial Engineering and Innovation Management, 5(2), 1-8. https://doi.org/10.23977/ieim.2022.050201
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Enrique Avila Soler, Brenda Aracely Ramírez Barraza , Julio César Ayllón Benítez , Jesús Vicente González-Sosa

This work is licensed under a Creative Commons Attribution 4.0 International License.
Los autores/as que publiquen en esta revista aceptan las siguientes condiciones:
- Los autores/as conservan los derechos de autor y ceden a la revista el derecho de la primera publicación, con el trabajo registrado con la licencia de atribución de Creative Commons 4.0, que permite a terceros utilizar lo publicado siempre que mencionen la autoría del trabajo y a la primera publicación en esta revista.
- Los autores/as pueden realizar otros acuerdos contractuales independientes y adicionales para la distribución no exclusiva de la versión del artículo publicado en esta revista (p. ej., incluirlo en un repositorio institucional o publicarlo en un libro) siempre que indiquen claramente que el trabajo se publicó por primera vez en esta revista.
- Se permite y recomienda a los autores/as a compartir su trabajo en línea (por ejemplo: en repositorios institucionales o páginas web personales) antes y durante el proceso de envío del manuscrito, ya que puede conducir a intercambios productivos, a una mayor y más rápida citación del trabajo publicado.



