Multi-Index Time Minimizing Transportation Problem
by
Archana Khurana
Research Scholar, Department of Mathematics, University of Delhi, INDIA
Coauthors: S.R. Arora (Hans Raj College, Department of Mathematics, University of Delhi, INDIA)

In this paper a multi-index time minimizing transportation problem is introduced. Two different algorithms for solving the given problem are discussed. Both these algorithms involve a finite number of iterations and are based on the concept of moving from one basic feasible solution to another basic feasible solution until it is not further possible to reduce the time. Also both the algorithms give the same result for all kinds of multi-index time transportation problems. So either of the two algorithms can be applied to solve a multi-index time transportation problem. The given technique is much simpler than the labeling technique used by Hammer and Szwarc for time transportation problems. Moreover the profit associated in this paper for the algorithm1 are just 0 and 1 and do not involve M on certain routes. Also the problem discussed by them is two dimensional while in this paper we have considered a three dimensional problem which can be extended to a multi-index time transportation problems. A numerical example to illustrate both the algorithms is also included.

Date received: September 5, 2003