| Abstract |
As the concept of sustainable development gains greater prominence, businesses are increasingly prioritizing the reuse of resources. However, the sustainable supply chain consists of multiple enterprises or organizations, and it is particularly urgent to achieve effective sustainable supply. Accordingly, the study proposes a sustainable supply chain management model with mixed integer planning as a solution to the problems of supplier selection and order allocation in sustainable supply chain management and the realization of sustainable supply. The branch bounding algorithm is to be enhanced by means of branch-bounding and then applied to the resolution of the sustainable supply chain management model with the objective of achieving the sustainability of the supply chain. The results showed that the improved branch bounding algorithm converged 34.18% faster than the unimproved algorithm and the average running time of the computational problem was reduced by 5.37%. The improved branch bounding algorithm had the highest number of items, variables, and constraints among all methods. The sustainable supply chain management model proposed in the study is rational and reliable and has significant advantages in the supplier selection and order allocation problems. The results demonstrate that the sustainable supply chain management model can effectively address the challenges associated with supplier selection and order allocation, which is conducive to the advancement of sustainable supply chain development, enterprise sustainability, and economic sustainability. The improved branch bounding algorithm using relaxation variables is superior in terms of problem size and speed, can find the most stable optimal solution in a set time, and is suitable for solving large-scale problems. |
