Comprehensive quantity discount model for dynamic green supplier selection and order allocation

Research output: Contribution to journalArticlepeer-review

Standard Standard

Comprehensive quantity discount model for dynamic green supplier selection and order allocation. / Hamdan, Sadeque; Cheaitou, Ali; Shikhli, Amir et al.
In: Computers and Operations Research, Vol. 160, 106372, 01.12.2023.

Research output: Contribution to journalArticlepeer-review

HarvardHarvard

Hamdan, S, Cheaitou, A, Shikhli, A & Alsyouf, I 2023, 'Comprehensive quantity discount model for dynamic green supplier selection and order allocation', Computers and Operations Research, vol. 160, 106372. https://doi.org/10.1016/j.cor.2023.106372

APA

Hamdan, S., Cheaitou, A., Shikhli, A., & Alsyouf, I. (2023). Comprehensive quantity discount model for dynamic green supplier selection and order allocation. Computers and Operations Research, 160, Article 106372. https://doi.org/10.1016/j.cor.2023.106372

CBE

Hamdan S, Cheaitou A, Shikhli A, Alsyouf I. 2023. Comprehensive quantity discount model for dynamic green supplier selection and order allocation. Computers and Operations Research. 160:Article 106372. https://doi.org/10.1016/j.cor.2023.106372

MLA

VancouverVancouver

Hamdan S, Cheaitou A, Shikhli A, Alsyouf I. Comprehensive quantity discount model for dynamic green supplier selection and order allocation. Computers and Operations Research. 2023 Dec 1;160:106372. Epub 2023 Aug 10. doi: 10.1016/j.cor.2023.106372

Author

Hamdan, Sadeque ; Cheaitou, Ali ; Shikhli, Amir et al. / Comprehensive quantity discount model for dynamic green supplier selection and order allocation. In: Computers and Operations Research. 2023 ; Vol. 160.

RIS

TY - JOUR

T1 - Comprehensive quantity discount model for dynamic green supplier selection and order allocation

AU - Hamdan, Sadeque

AU - Cheaitou, Ali

AU - Shikhli, Amir

AU - Alsyouf, Imad

PY - 2023/12/1

Y1 - 2023/12/1

N2 - We model and solve a deterministic multi-period single-product green supplier selection and order allocation problem in which the considered suppliers’ availability, cost, and green performance change from one period to another in the planning horizon. Moreover, the available suppliers may offer an all-unit or an incremental quantity discount (QD) scheme, resulting in three problem configurations. In one configuration, all suppliers offer all-unit QD. In the second, all suppliers offer incremental QD. In the third, some suppliers offer all-unit QD, and others offer incremental QD. The problem is modeled using a bi-objective integer linear programming formulation that maximizes the total green value of the purchased items from all the suppliers and minimizes their total corresponding cost, including the fixed cost, variable cost, inventory holding cost, and shortage cost. The proposed bi-objective model is scalarized and solved using the branch-and-cut algorithm and a population-based heuristic. A numerical analysis is conducted, which allows first to validate the heuristic approach using small-size instances by comparing its results with those of the exact approach. Moreover, an extensive comparison between the exact and heuristic solution approaches is carried out. The results reveal different findings. First, the economic and environmental solutions of an instance are different, and the environmental solution is independent of the suppliers’ pricing schemes. Second, the maximum difference between the heuristic approach and the exact approach in terms of the bi-objective function value is 4.72%, which makes the proposed heuristic recommended for large-size instances due to its short computation time and good accuracy. Third, there is no difference in terms of the heuristic performance between the combined model and the models with a single type of discount. Fourth, the all-unit discount scheme seems to be generally better in terms of the trade-off between the green value of purchasing and cost.

AB - We model and solve a deterministic multi-period single-product green supplier selection and order allocation problem in which the considered suppliers’ availability, cost, and green performance change from one period to another in the planning horizon. Moreover, the available suppliers may offer an all-unit or an incremental quantity discount (QD) scheme, resulting in three problem configurations. In one configuration, all suppliers offer all-unit QD. In the second, all suppliers offer incremental QD. In the third, some suppliers offer all-unit QD, and others offer incremental QD. The problem is modeled using a bi-objective integer linear programming formulation that maximizes the total green value of the purchased items from all the suppliers and minimizes their total corresponding cost, including the fixed cost, variable cost, inventory holding cost, and shortage cost. The proposed bi-objective model is scalarized and solved using the branch-and-cut algorithm and a population-based heuristic. A numerical analysis is conducted, which allows first to validate the heuristic approach using small-size instances by comparing its results with those of the exact approach. Moreover, an extensive comparison between the exact and heuristic solution approaches is carried out. The results reveal different findings. First, the economic and environmental solutions of an instance are different, and the environmental solution is independent of the suppliers’ pricing schemes. Second, the maximum difference between the heuristic approach and the exact approach in terms of the bi-objective function value is 4.72%, which makes the proposed heuristic recommended for large-size instances due to its short computation time and good accuracy. Third, there is no difference in terms of the heuristic performance between the combined model and the models with a single type of discount. Fourth, the all-unit discount scheme seems to be generally better in terms of the trade-off between the green value of purchasing and cost.

U2 - 10.1016/j.cor.2023.106372

DO - 10.1016/j.cor.2023.106372

M3 - Article

VL - 160

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

M1 - 106372

ER -