C运输问题

在传统的运输问题中 ,总假设所有产地 (发点 )的产量之和或所有销地 (收点 )的销量之和就是货物的总运输量 .但在实践中 ,特别是在一些与环境有关的资源、稀有资源或不可再生资源的开发利用过程中 ,由于受环境保护或政策限制 ,常常对这些资源的开采和运输有一定的数量限制 .这一类对总运输量有数量限制的运输问题不同于 A运输问题和 B运输问题 ,我们把它称为 C运输问题 .事实上 ,C运输问题是 A运输问题和 B运输问题的推广 .将给出 C运输问题的数学模型和求解方法 .

C-Transportation Problems

In a traditional transportation problem, it is always supposed that total transportation goods equals total output at all the places of production (sources) or total demand at all the markets (destinations). In practice, however, we often encounter some special cases, such as exploiting and transporting some special resources that are rare, cannot be reproduced or relate to the surroundings and so on, the exploitation and transportation are confined to a certain number for the sake of surroundings and policy. Such a problem differs from the A-transportation and B-transportation problems. We call it C-Transportation Problem. In fact, it is a future development of the A-transportation and B-transportation problems. In this paper, the mathematical model and solution of the C-transportation problem are given.