A Shootout Method for Time Minimizing Transportation Problem with Mixed Constraints

Abstract In practical world applications, the time minimizing transportation problem provides a powerful framework for determining better ways for timely delivery of goods to consumers. In this article, we propose a shootout method to determine the optimum time of transportation for the time minimizing transportation problem with mixed constraints. The proposed problem is a variant of the time minimizing transportation problem in which constraints are of mixed nature. The cells of the transportation table with decreasing order of time are avoided for allocation one by one until feasibility is maintained. The method is structured in the form of an algorithm and computationally tested on MATLAB through problems of various sizes. It solves the time minimizing transportation problem with equality constraints also.