Abstract
This paper considers the shortest time limit transportation problem with storage cost upper limitation on bipartite graph. The authors prove that its feasible solution corresponds to that of transportation problem uniquely, the basic feasible solution of transportation problem corresponds to its basic solution, and the optimal solution of transportation problem is one of its optimal solutions. Then we revise the transportation cost of the edge with longer transportation time into /spl infin/ continuously, and get its optimal solution by solving the transportation problem. Finally, the authors present an example to show that the algorithm runs easily and quickly.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call