Development hybrid OA-RG with multi-row time-aggregated cover cuts for solving MINLP in coffee plantation maintenance

Authors

DOI:

https://doi.org/10.15587/1729-4061.2025.342750

Keywords:

outer approximation, reduced gradient, MTACC, MINLP, plantation maintenance scheduling, limited resources optimization, smallholder coffee plantations, combinatorial optimization, time window constraints, decision support systems

Abstract

The object of this research is the NP-hard combinatorial optimization problem in the allocation of limited resources for the maintenance of smallholder coffee plantations. In this study, a hybrid method of outer Approximation (OA) and reduced gradient (RG), enhanced by multi-row time-aggregated cover cuts (MTACC) is proposed to address the computational time efficiency problem in mixed-integer nonlinear programming (MINLP)-based combinatorial optimization problems. The testing was conducted using plantation land data from the Rahmat Kinara Coffee Farmers Association, which includes 538 land blocks with a total area of 825.5 hectares. Based on the numerical results obtained, it shows a reduction in the number of iterations by up to 38.83% and an increase in the speed of convergence time by up to 12.84%. The nw feature in MTACC specifically controls the length of the time window to form multi-row covering slices that are suitable for the characteristics of the constraints, which affects the master and RG subproblems in overcoming the computational load. The evaluation results for testing parameters nw = 7 and nw = 14 show an increased contribution to convergence time of up to 10.1% by reducing the average master MILP time by 6.16%. Evaluation of the area under curve (AUC) metric confirms that MTACC is more stable in controlling optimality gaps across global iterations based on AUC (abs) assessment, which decreased by 21.6%; AUC per iteration decreased by 19.9%, and normalized AUC also decreased by 18.6%.

The results obtained can be effectively applied in small to large-scale coffee plantations, especially in decision support systems on low-power computing devices for production sustainability

Author Biographies

Eko Hariyanto, Universitas Sumatera Utara

Doctoral Candidate

Department of Computer Science and Information Technology

Poltak Sihombing, Universitas Sumatera Utara

Doctor of Computer Science, Professor

Department of Computer Science and Information Technology

Erna Budhiarti Nababan, Universitas Sumatera Utara

Doctor of Computer Science, Associate Professor

Department of Computer Science and Information Technology

Sawaluddin Sawaluddin, Universitas Sumatera Utara

Doctor of Computer Science, Associate Professor

Department of Mathematics and Natural Sciences

References

  1. Tharatipyakul, A., Pongnumkul, S., Riansumrit, N., Kingchan, S., Pongnumkul, S. (2022). Blockchain-Based Traceability System From the Users’ Perspective: A Case Study of Thai Coffee Supply Chain. IEEE Access, 10, 98783–98802. https://doi.org/10.1109/access.2022.3206860
  2. Wulandari, S., Djufry, F., Villano, R. (2022). Coping Strategies of Smallholder Coffee Farmers under the COVID-19 Impact in Indonesia. Agriculture, 12 (5), 690. https://doi.org/10.3390/agriculture12050690
  3. Parmawati, R., Risvita, W., Hakim, L., Rahmawati, N. O., Gunawan, F. K., Ashari, F. M., Haqqi, S. S. (2023). Sustainability Index of Robusta Coffee Plantation (Case Study: Wagir District Smallholder Coffee Plantation in Malang, Indonesia). International Journal of Design & Nature and Ecodynamics, 18 (2), 279–288. https://doi.org/10.18280/ijdne.180205
  4. Hartoyo, A. P. P., Hutagalung, L., Kulsum, F., Sunkar, A., Herliyana, E. N., Hidayati, S. (2023). Species composition, structure, and management in gayo coffee-based agroforestry system. Jurnal Pengelolaan Sumberdaya Alam Dan Lingkungan (Journal of Natural Resources and Environmental Management), 13 (1), 37–48. https://doi.org/10.29244/jpsl.13.1.37-48
  5. Jiang, Y., Chen, L., Fang, Y. (2018). Integrated Harvest and Distribution Scheduling with Time Windows of Perishable Agri-Products in One-Belt and One-Road Context. Sustainability, 10 (5), 1570. https://doi.org/10.3390/su10051570
  6. Hajirad, I., Ahmadaali, K., Liaghat, A. (2025). Crop yield and water productivity modeling using nonlinear growth functions. Scientific Reports, 15 (1). https://doi.org/10.1038/s41598-025-16096-0
  7. Abd El Baki, H. M., Fujimaki, H., Tokumoto, I., Saito, T. (2024). Optimization of irrigation scheduling using crop–water simulation, water pricing, and quantitative weather forecasts. Frontiers in Agronomy, 6. https://doi.org/10.3389/fagro.2024.1376231
  8. Baghizadeh, K., Cheikhrouhou, N., Govindan, K., Ziyarati, M. (2021). Sustainable agriculture supply chain network design considering water‐energy‐food nexus using queuing system: A hybrid robust possibilistic programming. Natural Resource Modeling, 35 (1). https://doi.org/10.1111/nrm.12337
  9. Baihaqi, A., Sofiana, U., Usman, M., Bagio, B. (2022). Risk analysis of arabica coffee supply chain in Aceh Tengah regency, Aceh Province, Indonesia. Coffee Science, 16, 1–9. https://doi.org/10.25186/.v16i.1984
  10. Kronqvist, J., Bernal Neira, D. E., Grossmann, I. E. (2025). 50 years of mixed-integer nonlinear and disjunctive programming. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2025.07.016
  11. Patty, S., Das, R., Mandal, D., Roy, P. K. (2025). Self-adaptive multi-population quadratic approximation guided jaya optimization applied to economic load dispatch problems with or without valve-point effects. Results in Control and Optimization, 19, 100543. https://doi.org/10.1016/j.rico.2025.100543
  12. Liñán, D. A., Ricardez-Sandoval, L. A. (2025). Trends and perspectives in deterministic MINLP optimization for integrated planning, scheduling, control, and design of chemical processes. Reviews in Chemical Engineering, 41 (5), 451–472. https://doi.org/10.1515/revce-2024-0064
  13. De Mauri, M., Gillis, J., Swevers, J., Pipeleers, G. (2020). A proximal-point outer approximation algorithm. Computational Optimization and Applications, 77 (3), 755–777. https://doi.org/10.1007/s10589-020-00216-9
  14. Liu, Z. E., Long, W., Chen, Z., Littlefield, J., Jing, L., Ren, B. et al. (2024). A novel optimization framework for natural gas transportation pipeline networks based on deep reinforcement learning. Energy and AI, 18, 100434. https://doi.org/10.1016/j.egyai.2024.100434
  15. Wu, O., Muts, P., Nowak, I., Hendrix, E. M. T. (2024). On the use of overlapping convex hull relaxations to solve nonconvex MINLPs. Journal of Global Optimization, 91 (2), 415–436. https://doi.org/10.1007/s10898-024-01376-2
  16. Kohar, A., Jakhar, S. K., Agarwal, Y. K. (2023). Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 176, 102806. https://doi.org/10.1016/j.trb.2023.102806
  17. Melo, W., Fampa, M., Raupp, F. (2020). Two linear approximation algorithms for convex mixed integer nonlinear programming. Annals of Operations Research, 316 (2), 1471–1491. https://doi.org/10.1007/s10479-020-03722-5
  18. Javaloyes-Antón, J., Kronqvist, J., Caballero, J. A. (2022). Simulation-based optimization of distillation processes using an extended cutting plane algorithm. Computers & Chemical Engineering, 159, 107655. https://doi.org/10.1016/j.compchemeng.2021.107655
  19. Muts, P., Nowak, I., Hendrix, E. M. T. (2020). The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. Journal of Global Optimization, 77 (1), 75–96. https://doi.org/10.1007/s10898-020-00888-x
  20. Deza, A., Khalil, E. B. (2023). Machine Learning for Cutting Planes in Integer Programming: A Survey. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 6592–6600. https://doi.org/10.24963/ijcai.2023/739
  21. Kronqvist, J., Misener, R. (2020). A disjunctive cut strengthening technique for convex MINLP. Optimization and Engineering, 22 (3), 1315–1345. https://doi.org/10.1007/s11081-020-09551-6
  22. Bestuzheva, K., Gleixner, A., Vigerske, S. (2023). A computational study of perspective cuts. Mathematical Programming Computation, 15 (4), 703–731. https://doi.org/10.1007/s12532-023-00246-4
  23. Lundell, A., Kronqvist, J., Westerlund, T. (2022). The supporting hyperplane optimization toolkit for convex MINLP. Journal of Global Optimization, 84 (1), 1–41. https://doi.org/10.1007/s10898-022-01128-0
  24. Vo, T., Baiou, M., Nguyen, V. H., Weng, P. (2025). Learning to Cut Generation in Branch-and-Cut Algorithms for Combinatorial Optimization. ACM Transactions on Evolutionary Learning and Optimization, 5 (3), 1–27. https://doi.org/10.1145/3728371
  25. Peng, Z., Cao, K., Furman, K. C., Li, C., Grossmann, I. E., Neira, D. E. B. (2024). A Convexication-based Outer-approximation Method for Convex and Nonconvex MINLP. 34th European Symposium on Computer Aided Process Engineering / 15th International Symposium on Process Systems Engineering, 3211–3216. https://doi.org/10.1016/b978-0-443-28824-1.50536-6
  26. Lundell, A., Kronqvist, J. (2021). Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT. Journal of Global Optimization, 82 (4), 863–896. https://doi.org/10.1007/s10898-021-01006-1
  27. Bodur, M., Del Pia, A., Dey, S. S., Molinaro, M., Pokutta, S. (2017). Aggregation-based cutting-planes for packing and covering integer programs. Mathematical Programming, 171 (1-2), 331–359. https://doi.org/10.1007/s10107-017-1192-x
  28. Zhang, Y., Chang, R., Omrany, H., Zuo, J., Burry, J., Gu, N. (2025). Policy-gradient scheduling optimisation under multi-skill constraints: A comparative study on computational algorithms. Journal of Building Design and Environment. https://doi.org/10.70401/jbde.2025.0017
Development hybrid OA-RG with multi-row time-aggregated cover cuts for solving MINLP in coffee plantation maintenance

Downloads

Published

2025-12-17

How to Cite

Hariyanto, E., Sihombing, P., Nababan, E. B., & Sawaluddin, S. (2025). Development hybrid OA-RG with multi-row time-aggregated cover cuts for solving MINLP in coffee plantation maintenance. Eastern-European Journal of Enterprise Technologies, 6(4 (138), 36–48. https://doi.org/10.15587/1729-4061.2025.342750

Issue

Vol. 6 No. 4 (138) (2025): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2025 Eko Hariyanto, Poltak Sihombing, Erna Budhiarti Nababan, Sawaluddin Sawaluddin

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.