Abstract
Based on physical range of corn planting, an optimal corn planting model is being developed, so that the weekly yeald results in the maximum occupacy of the available warehouses. The problem was solved using Dynamic Programming method called Knapsack Problem. With this method, yearly crop losses were minimized.
References
[1] R. Bellman, Dynamic programming, New Jersey: Princeton University, 1957..
[2] J. Réveillac, Optimization tools for logistics, Elsevier, 2015.
[3] M. a. J. Z. Rapaić, Projektovanje linearnih regulatora i estimatora u prostoru stanja, Novi Sad: Univerzitet u Novom Sadu, Fakultet tehničkih nauka, 2014.
[4] P. a. G. R. Gilmore, The theory and computation of knapsack functions, 1966.
[5] “0/1 Knapsack problem,” 6 August 2022. [Online]. Available: https://www.guru99.com/knapsack-problem-dynamic-programming.html. [Accessed 22 September 2022].
[6] “SCiO Analytics,” [Online]. Available: https://scio.systems/. [Accessed 2022].
[7] S. D. G. H. Kimenju, “Crop loss in % of weight of stored maize,” 2022.