This paper deals with the two-stage transportation problem with fixed charges, denoted by TSTPFC. We propose a fast solving method, designed for parallel environments, that allows solving real-world applications efficiently. The proposed constructive heuristic algorithm is iterative and its primary feature is that the solution search domain is reduced at each iteration. Our achieved computational results were compared with those of the existing solution approaches. We tested the method on two sets of instances available in literature. The outputs prove that we have identified a very competitive approach as compared to the methods than one can find in literature. PDF  XML

中文翻译：

---

解决两阶段固定费用运输问题的并行算法

本文讨论了固定收费的两阶段运输问题，用TSTPFC表示。我们提出了一种针对并行环境设计的快速解决方法，该方法可以有效地解决实际应用。所提出的构造启发式算法是迭代的，其主要特征是在每次迭代中都减少了求解搜索域。将我们获得的计算结果与现有解决方案方法进行了比较。我们在文献中提供的两组实例上测试了该方法。输出结果证明，与文献中无法找到的方法相比，我们已经确定了一种非常有竞争力的方法。PDF XML