一类运输问题的数学模型及算法研究

Study of the Mathematical Model and Algorithms for a Class of Transportation Problems

研究一类运输问题的优化方法，分别用Go矩阵和Return矩阵描述卡车的双向调度方案，建立了一个综合规划的数学模型，并以总运量和出动卡车的数量最小为目标，以品位限制、供需限制、车辆容量限制等为约束条件，以分步优化、逐层突破的方法给出了模型的优化解法．

The paper is mainly on the optimizing method for a class of transportation problem. We separately use Go matrix and Return matrix to describe the bidirectional dispatching scheme for trucks, and build an integrative programming mathematical model. We treat the maximal total carrying amount and the minimal trucks needed as the target, and restrict it with the value of goods, the amount of supply and demand, the capacity of the trucks and so on. We get the optimizing algorithms by step--by--step attacking and optimizing, and finally apply to a given example and get the satisfying answer.