DocumentCode :
1571070
Title :
A kind of shortest time limit transportation problem with cost constraints
Author :
Dong, Zheming ; Ma, Jianhua
Author_Institution :
Sch. of Math. & Syst. Sci., Shandong Univ., Jinan, China
Volume :
4
fYear :
2004
Firstpage :
2963
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 ∞ 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.
Keywords :
graph theory; optimisation; problem solving; transportation; bipartite graph; cost constraints; optimal solutions; shortest time limit transportation problem; Bipartite graph; Cost function; Mathematics; Time factors; Transportation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN :
0-7803-8273-0
Type :
conf
DOI :
10.1109/WCICA.2004.1343060
Filename :
1343060
Link To Document :
بازگشت