Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/310221 
Year of Publication: 
2022
Citation: 
[Journal:] Logistics [ISSN:] 2305-6290 [Volume:] 6 [Issue:] 1 [Article No.:] 8 [Year:] 2022 [Pages:] 1-18
Publisher: 
MDPI, Basel
Abstract: 
Currently, the supplier selection process is considered as an integral part of the supply chain. The appropriate selection of suppliers plays a preponderant role in the performance chain of supply as it determines relevant aspects such as cost management and flexibility of most production processes. Background: It is considered a multi-criteria and multi-objective problem because it includes both qualitative and quantitative factors. Method: To solve the Supplier Selection and Fair Order Allocation Problem (SSFOAP), a hybrid solution methodology based on the best-worst method (BWM) and MMD-TOPSIS techniques in the first phase has been developed to find a robust ranking of suppliers. In the second phase to determine the weight of the objective function, the Linear Programming (LP) approach is used. Results: This proposed model can help decisionmakers find the right orders for each supplier and enable purchasing managers to manage supply chain performance in terms of cost, quality, and service. To test the performance of our solution methodology, we apply our hybrid technique to solve a real case of the Tunisian Electric Society (TSE). Cplex software is used to solve bi-objective programming and to answer strategic questions. Conclusions: The experimental results indicate that the combination of MMD-TOPSIS and bi-objective programming provide effective gain concerning solution quality compared with the given solution of the administrator of TSE.
Subjects: 
mixed data
order allocation
suitability indices
supplier selection problem
TOPSIS
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.