Study On The Transportation Problem For A Pair Of Disjoint Solutions And The Transportation Problem With Resources

Today,with the increasing popularity of e-commerce,the transport volume of goods and materials is increasing explosively,and the way of making transportation plans by experience is no longer able to meet people's needs.How to design an effective optimization algorithm for different transportation problems,so as to make the total transportation cost as small as possible,is an important issue in front of people.In this paper,two kinds of new transportation problems are proposed and studied: "the transportation problem for a pair of disjoint solutions" and "the transportation problem with resources".In the first chapter of this thesis,the research status of transportation problem is summarized.In the second chapter,we propose and study the transportation problem for a pair of disjoint solutions,and give an iterative algorithm to solve the transportation problem.In addition,we also study a special kind of transportation problem for a pair of disjoint solutions.For the special kind of transportation problem for a pair of disjoint solutions,we first give a necessary and sufficient condition for the existence of feasible solution to the problem;then,we give the properties of the problem and an algorithm for solving this kind of problems when m=3,n=4;finally,we give an algorithm to obtain a optimal approximate solution to this kind of transportation problem,and the optimal approximate solution can be used as the initial solution,when we obtain the optimal solution of the problem by the iterative algorithm described at the beginning of this chapter.In the third chapter,the transportation problem with resource s is proposed and studied.An algorithm for solving this problem when the resource is abundant,and an algorithm for solving the problem when the resource is not enough are proposed.In the fourth chapter,the research of this thesis is summarized and future research work is put forward.