MILP Model Solution Steps: Implementation of Big M Simplex and Branch and Bound in the Coffee Supply Chain

Ananda Hans Islamiyah, Umu Sa'adah, Corina Karim

Abstract


This research aims to develop a Mixed-Integer Linear Programming (MILP) model to optimize the distribution of coffee from producing sub-districts to storage warehouses, and subsequently to destination markets in Malang Regency during the 2020–2024 period. This model minimizes total logistics costs, which include distribution, shipping, and warehouse operating costs. The Big M Simplex method is used to handle logical constraints in the model, while the Branch and Bound algorithm is used to determine the operational state of the warehouse as a binary variable. The optimization results show that the warehouse is actively operated every year, with a distribution flow capable of meeting all market demands. The optimal purpose function value obtained is IDR 43,265,867,761,500,-. for five years. This shows that the combination of MILP, Big M, and Branch and Bound is effective as a decision-making framework in the optimization of the agribusiness sector's supply chain. This model considers temporal, spatial, and operational cost aspects, so it can be applied practically to data-driven distribution planning. This research contributes to the development of a relevant structured optimization approach for multi-period supply chain systems and discrete decisions

Keywords


Big-M method, Branch and bound, Coffee supply chain, MILP, Optimization distribution

Full Text:

PDF

References


S. I. G. Putra, F. N. D. Nadia, E. B. Gusminto, and D. P. Musmedi, “Analisis Kinerja Supply Chain pada Agroindustri Kopi,” *J. Ekon. Modernisasi*, vol. 15, no. 1, pp. 30–42, 2019, doi: 10.21067/jem.v15i1.2912.

A. Saif and S. Elhedhli, “Cold supply chain design with environmental considerations: A simulation-optimization approach,” *Eur. J. Oper. Res.*, vol. 251, no. 1, pp. 274–287, 2016, doi: 10.1016/j.ejor.2015.10.056.

A. A. Sukur, *Analisis Rantai Pasok dan Efisiensi Pemasaran Kopi Robusta di CV. Kopi Citarasa Persada Kecamatan Tutur Kabupaten Pasuruan*, Ph.D. dissertation, UPN Veteran Jawa Timur, 2024.

R. W. Putri and D. Retnoningsih, “The Effect of Sustainable Supply Chain Management on the Performance of Certified Organic Coffee at Malang Regency,” *Habitat*, vol. 33, no. 1, pp. 74–85, 2022, doi: 10.21776/ub.habitat.2022.033.1.8.

K. F. ND *et al.*, “SUPPLY CHAIN INNOVATION AND COMPETITIVE ADVANTAGE IN THE COFFEE BUSINESS IN CENTRAL ACEH DISTRICT, ACEH PROVINCE,” *Agrisaintifika: J. Ilmu-Ilmu Pertan.*, vol. 8, no. 2, pp. 229–243, 2024, doi: 10.32585/ags.v8i2.5815.

F. Trespalacios and I. E. Grossmann, “Improved Big-M reformulation for generalized disjunctive programs,” *Comput. Chem. Eng.*, vol. 76, pp. 98–103, 2015, doi: 10.1016/j.compchemeng.2015.02.013.

J. Qiu, “Branch Definition-Based Modeling for Sustainable Supply Chain Management in Regional Digital Economy,” *Process Integr. Optim. Sustain.*, vol. 8, no. 5, pp. 1603–1614, 2024, doi: 10.1007/s41660-024-00449-9.

J. Zhang *et al.*, “A survey for solving mixed integer programming via machine learning,” *Neurocomputing*, vol. 519, pp. 205–217, 2023, doi: 10.1016/j.neucom.2022.11.024.

A. Babaei, M. Khedmati, and M. R. A. Jokar, “A branch and efficiency algorithm to design a sustainable two-echelon supply chain network considering traffic congestion and uncertainty,” *Environ. Sci. Pollut. Res.*, vol. 30, no. 10, pp. 28274–28304, 2023, doi: 10.1007/s11356-022-24063-9.

J. J. Vicente, “Optimizing Supply Chain Inventory: A Mixed Integer Linear Programming Approach,” *Systems*, vol. 13, no. 1, p. 33, 2025, doi: 10.3390/systems13010033.

V. H. Duong and N. H. Bui, “A mixed-integer linear formulation for a capacitated facility location problem in supply chain network design,” *Int. J. Oper. Res.*, vol. 33, no. 1, pp. 32–54, 2018, doi: 10.1504/IJOR.2018.094230.

T. Kleinert, M. Labbé, F. Plein, and M. Schmidt, “There’s no free lunch: on the hardness of choosing a correct big-M in bilevel optimization,” *Oper. Res.*, vol. 68, no. 6, pp. 1716–1721, 2020, doi: 10.1287/opre.2019.1944.

A. Przybylski and X. Gandibleux, “Multi-objective branch and bound,” *Eur. J. Oper. Res.*, vol. 260, no. 3, pp. 856–872, 2017, doi: 10.1016/j.ejor.2017.01.032.

D. Bhati and P. Singh, “Branch and bound computational method for multi-objective linear fractional optimization problem,” *Neural Comput. Appl.*, vol. 28, no. 11, pp. 3341–3351, 2017, doi: 10.1007/s00521-016-2243-6.

A. Babaei, M. Khedmati, and M. R. A. Jokar, “A new branch and efficiency algorithm for an optimal design of the supply chain network in view of resilience, inequity and traffic congestion,” *Ann. Oper. Res.*, vol. 321, no. 1, pp. 49–78, 2023, doi: 10.1007/s10479-022-05080-w.

S. Das Gupta, B. P. G. Van Parys, and E. K. Ryu, “Branch-and-bound performance estimation programming: A unified methodology for constructing optimal optimization methods,” *Math. Program.*, vol. 204, no. 1, pp. 567–639, 2024, doi: 10.1007/s10107-023-01973-1.

J. Essien, “Application of Branch and Bound and Dynamic Programming in Demand Forecasting for Supply Chain Optimization,” *Int. J. Sci. Res.*, vol. 12, no. 5, pp. 2617–2623, 2023, doi: 10.21275/SR23528175430.

A. Mohammed and S. O. Duffuaa, “A hybrid algorithm based on tabu search and generalized network algorithm for designing multi-objective supply chain networks,” *Neural Comput. Appl.*, vol. 34, no. 23, pp. 20973–20992, 2022, doi: 10.1007/s00521-022-07573-y.

S. Prawitasari *et al.*, “Assessment Of Risk As A Sustainable Coffee Supply Chain Strategy on Rural Area In Jember Regency,” *J. Penelit. Ipteks*, vol. 9, no. 1, pp. 131–148, 2024, doi: 10.32528/penelitianipteks.v9i1.1502.

S. K. Sahoo and S. S. Goswami, “A comprehensive review of multiple criteria decision-making (MCDM) methods: advancements, applications, and future directions,” *Decis. Mak. Adv.*, vol. 1, no. 1, pp. 25–48, 2023, doi: 10.31181/dma1120237.




DOI: https://doi.org/10.18860/cauchy.v10i2.35380

Refbacks

  • There are currently no refbacks.


Copyright (c) 2025 Ananda Hans Islamiyah

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

Editorial Office
Mathematics Department,
Universitas Islam Negeri Maulana Malik Ibrahim Malang
Gajayana Street 50 Malang, East Java, Indonesia 65144
Faximile (+62) 341 558933
e-mail: cauchy@uin-malang.ac.id

Creative Commons License
CAUCHY: Jurnal Matematika Murni dan Aplikasi is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.