A Priority Based Time Minimization Transportation Problem

Abstract

This paper discusses a priority based time minimizing transportation problem in which destinations are prioritized so that the material is supplied, based upon the priorities of the destinations. All the destinations, which are at priority, are served first in stage-I while the demands of the secondary destinations are met in stage-II. It is assumed that secondary transportation can not take place until the primary transportation is done. The purpose is to transport in such a manner that the sum of the transportation time of primary and secondary destinations is minimum. To achieve this two algorithms are proposed. In the first approach, primary destinations are served optimally by giving weights and the second one is using lexicographic optimization. From the generated pairs, the minimum sum of times corresponding to Stage-I and Stage-II times is picked up as the optimal solution. It is also shown through Computational Details that the lexicographic optimization approaches optimality faster.