Study On Transportation Problems Of Capacitated Supplies And Demands With Constraints

Effective transportation of goods and materials has often been strongly cared by researchers and practitioners. Because of the complexity of the transportation environment, the research of variety kinds of transportation model is particularly important. For a classical transportation problem model, the basic feasible solution corresponds to a basic feasible tree. This thesis is mainly to extensively discuss a new kind of transportation problem model in which supplies and demands are not constant but fall in given intervals.In this paper, we study a kind of capacitated transportation problems. The proposed capacitated transportation problem model here is that each supply ai of origin A_i (i=1,2,..., m) and/or each demand bj of destination B_j (j= 1,2,..., n) of transportation problem is not a constant but a given interval. We referred to it as capacitated transportation problem. In the first chapter some background knowledge of transportation problems are introduced. In the second chapter a specified tree transportation problem is proposed and the feasibility of a specified tree of the capacitated transportation problem as well as several types of transportation problem model for a given basic feasible tree and algorithms are discussed, and corresponding numerical examples are given. In the third chapter the common feasible tree of two capacitated transportation problems are systematically discussed. The fourth chapter summarizes the paper and proposed some future research work.