An efficient algorithm for multiobjective transportation problems

The multiobjective transportation problem is introduced and an efficient algorithm for its solution has been developed. The algorithm takes advantage of using optimal solutions of any objective function as the basic feasible solutions (BFSs) for the succeeding objective and reducing the set of solutions to most compromising solution to the combined objective function. To demonstrate the effectiveness of the algorithm, the problem involving four objectives has been considered. As a particular case, the two objective transportation problem "Optimizing Dead Mileage in Urban Bus Routes" solved by Sharma and Prakash (Journal of Transportation Engineering, ASCE, 1986) has been re-investigated, It has been noticed that our algorithm finds the same results obtained earlier, however, in a simpler way and may even be successfully applied for solving transportation problems with more than two objectives.