Solving the Single-Valued Trapezoidal Neutrosophic Transportation Problems through the Novel Dhouib-Matrix-TP1 Heuristic
The transportation problem has been widely studied in the field of supply chain management where circulation of products with a minimal transportation cost is an important issue. This paper presents the first adaptation of the Dhouib-Matrix-TP1 heuristic to solve the transportation problem in single...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Hindawi Limited
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/8e0d62b5ac58439f984a6b0836271437 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | The transportation problem has been widely studied in the field of supply chain management where circulation of products with a minimal transportation cost is an important issue. This paper presents the first adaptation of the Dhouib-Matrix-TP1 heuristic to solve the transportation problem in single-valued trapezoidal neutrosophic environment. Hence, the recently developed Dhouib-Matrix-TP1 heuristic is enriched with two functions to solve the neutrosophic transportation problem. On the one hand, a defuzzification function is exploited in order to convert the single-valued trapezoidal neutrosophic numbers to crisp numbers. On the other hand, an original metric function (Average-Min) is proposed with the intention of performing the nodes selection process. With an illustration from a literature example, we show to the decision maker the multiple advantages of the novel heuristic Dhouib-Matrix-TP1 which can be easily implemented in real-life industrial transportation under neutrosophic environment. |
|---|