Time Minimizing Multi-Index Bulk Transportation Problem

Abstract

In industries, usually, two or more than two types of commodities are manufactured to maximize the profit. Sometimes, commodities are supplied to multiple warehouses via different modes of transportation. To deal such type of problems in transportation, transportation problems are extended into Multi-Index Transportation Problems(MITP). In this paper, Multi-Index Bulk Transportation problem(MIBTP) which is anextension of Bulk Transportation Problem(BTP) having two modes of transportation with time minimizing objective is considered.In the present paper, VAM is extended to study the time minimizing MIBTP already studied by Latha [23] and a comparative study is done on the existing method and proposed amethod.