Abstract
To meet the challenge of delivering products to the customers in a minimum time, Time Minimization Transportation Problem (TMTP) provides a powerful framework to determine the better ways to deliver products to the customer. In this paper, we present a new procedure for determining an initial basic feasible solution of TMTP. Comparative study is accomplished between the presented procedure and the other existing procedures in virtue of sample examples which demonstrate that the presented procedure requires less number of iterations to reach the optimal transportation time.