TY - JOUR

T1 - Total opportunity cost matrix – Minimal total

T2 - A new approach to determine initial basic feasible solution of a transportation problem

AU - Amaliah, Bilqis

AU - Fatichah, Chastine

AU - Suryani, Erma

N1 - Publisher Copyright:
© 2019

PY - 2019/7

Y1 - 2019/7

N2 - Transportation Problem (TP) deals with cost planning for delivering the product from the source to the destination and Initial Basic Feasible Solution (IBFS) is presented to find the way out in obtaining an optimal solution. IBFS is an important element to reach an optimal result. The previous methods related to it did not always provide the satisfied result all the time. Therefore a new method called Total Opportunity Cost Matrix – Minimal Total (TOCM-MT) to determine IBFS as a basic solution to solve TP was proposed. The objective is to achieve a total cost with similar or closer values to the optimal solution. TOCM for the initial matrix and a better mechanism are highly considered to obtain IBFS. Thirty-one numerical examples, in which twenty-five were selected from some journals and six were generated randomly, were used to evaluate the performance of it. The proposed method has been compared to Vogel's Approximation Method (VAM), Juman and Hoque Method (JHM), and Total Differences Method 1 (TDM1). TOCM-MT was proven to have twenty-four numerical examples with similar values and seven numerical examples with closer values to the optimal solution. The experiment results indicated that TOCM-MT obtained better minimal cost than that of VAM, JHM, and TDM1.

AB - Transportation Problem (TP) deals with cost planning for delivering the product from the source to the destination and Initial Basic Feasible Solution (IBFS) is presented to find the way out in obtaining an optimal solution. IBFS is an important element to reach an optimal result. The previous methods related to it did not always provide the satisfied result all the time. Therefore a new method called Total Opportunity Cost Matrix – Minimal Total (TOCM-MT) to determine IBFS as a basic solution to solve TP was proposed. The objective is to achieve a total cost with similar or closer values to the optimal solution. TOCM for the initial matrix and a better mechanism are highly considered to obtain IBFS. Thirty-one numerical examples, in which twenty-five were selected from some journals and six were generated randomly, were used to evaluate the performance of it. The proposed method has been compared to Vogel's Approximation Method (VAM), Juman and Hoque Method (JHM), and Total Differences Method 1 (TDM1). TOCM-MT was proven to have twenty-four numerical examples with similar values and seven numerical examples with closer values to the optimal solution. The experiment results indicated that TOCM-MT obtained better minimal cost than that of VAM, JHM, and TDM1.

KW - Initial basic feasible solution

KW - Optimal solution

KW - Total opportunity cost matrix

KW - Transportation problem

UR - http://www.scopus.com/inward/record.url?scp=85060483938&partnerID=8YFLogxK

U2 - 10.1016/j.eij.2019.01.002

DO - 10.1016/j.eij.2019.01.002

M3 - Article

AN - SCOPUS:85060483938

SN - 1110-8665

VL - 20

SP - 131

EP - 141

JO - Egyptian Informatics Journal

JF - Egyptian Informatics Journal

IS - 2

ER -