TY - GEN
T1 - Total opportunity cost matrix - Supreme cell
T2 - 8th International Conference on Computer and Communications Management, ICCCM 2020
AU - Amaliah, Bilqis
AU - Fatichah, Chastine
AU - Suryani, Erma
AU - Muswar, Aisyah
N1 - Publisher Copyright:
© 2020 ACM.
PY - 2020/7/17
Y1 - 2020/7/17
N2 - Transportation Problem (TP) is delivering the product from supply to demand proposed to determine the minimal total cost. Initial Basic Feasible Solution (IBFS) is a foundation to find an optimal solution of TP. The previous methods did not provide optimal solution all the time. Therefore, in this paper, a new method called Total Opportunity Cost Matrix - Supreme Cell (TOCM-SC) was proposed to get better IBFS. This study aimed to achieve a minimal total as the optimal solution of TP. TOCM-SC can have a better result compared with other methods; since this method initializes the original matrix into the TOCM and starts with the cell, which has the highest supreme value. Twenty-three numerical examples selected from some journals were used to evaluate the performance of TOCM-SC. The proposed method, TOCM-SC, has been compared to other Initial Basic Feasible Solutions namely: Incessant Allocation Method (IAM), Vogel's Approximation Method (VAM), and Total Differences Method 1 (TDM1). The results of experiment show that TOCM-SC obtained better minimal cost than IAM, VAM, and TDM1. TOCM-SC achieved the optimal solution for seventeen of Twenty-three numerical examples with 73.91% accuracy.
AB - Transportation Problem (TP) is delivering the product from supply to demand proposed to determine the minimal total cost. Initial Basic Feasible Solution (IBFS) is a foundation to find an optimal solution of TP. The previous methods did not provide optimal solution all the time. Therefore, in this paper, a new method called Total Opportunity Cost Matrix - Supreme Cell (TOCM-SC) was proposed to get better IBFS. This study aimed to achieve a minimal total as the optimal solution of TP. TOCM-SC can have a better result compared with other methods; since this method initializes the original matrix into the TOCM and starts with the cell, which has the highest supreme value. Twenty-three numerical examples selected from some journals were used to evaluate the performance of TOCM-SC. The proposed method, TOCM-SC, has been compared to other Initial Basic Feasible Solutions namely: Incessant Allocation Method (IAM), Vogel's Approximation Method (VAM), and Total Differences Method 1 (TDM1). The results of experiment show that TOCM-SC obtained better minimal cost than IAM, VAM, and TDM1. TOCM-SC achieved the optimal solution for seventeen of Twenty-three numerical examples with 73.91% accuracy.
KW - Transportation problem
KW - initial basic feasible solution
KW - optimal solution
KW - total opportunity cost matrix
UR - http://www.scopus.com/inward/record.url?scp=85090895966&partnerID=8YFLogxK
U2 - 10.1145/3411174.3411198
DO - 10.1145/3411174.3411198
M3 - Conference contribution
AN - SCOPUS:85090895966
T3 - ACM International Conference Proceeding Series
SP - 151
EP - 156
BT - Proceedings of the 8th International Conference on Computer and Communications Management, ICCCM 2020
PB - Association for Computing Machinery
Y2 - 17 July 2020 through 19 July 2020
ER -