An Efficient Approach for Transforming Unbalanced Transportation Problems into Balanced Problems in Order to Find Optimal Solutions

In operations research, the transportation problem (TP) is among the earliest and most effective applications of the linear programming problem. Unbalanced transportation problems reflect the reality of supply chain and logistics situations where the available supply of goods may not precisely match the demand at different locations. To deal with an unbalanced transportation problem (UTP), it is essential first to convert it into a balanced transportation problem (BTP) to find an initial basic feasible solution (IBFS) and hence the optimal solution. The present paper is concerned with introducing a new approach to convert an unbalanced transportation problem into a balanced one and as a consequence to obtain optimum total transportation cost. Numerical examples are provided to demonstrate the suggested method.

一类产销不平衡最短时限运输问题的求解

研究产量大于销量的产销不平衡最短时限运输问题.考虑运输时间与运输量相关,存在禁运与封锁,运输能力限制等情况,给出了多项式时间算法.该算法能够较快地找到最优运输方案.

产销不平衡运输问题初始方案的改进-基于表上作业法

表上作业法是求解运输问题的有效方法,对于由产销不平衡运输问题转换得到的产销平衡运输问题求解时,由于存在多个同为最小的单位运价为零(因引入的虚拟产地或虚拟销地),选择何者作为最开始的最小单位运价直接影响了初始调运方案的质量。但只在原有的实际单位运价范围内寻找最小值即可有效简化计算过程,本文结合实例验证了该改进规则的有效性。