فهرست نشریات علمی دسترسی آزاد ایران

In supply chains, the goal is usually to meet demand at the lowest cost. But there are cases where either the transportation costs are insignificant or, such as in critical situations, the supply of more goods has a much higher priority than the costs. In such cases, instead of minimizing the cost, we should maximize the transfer flow values. In this case, the supply chain network minimization problem (minimum cost flow) becomes a type of flow maximization problem (maximum flow). In this paper, we have addressed a type of flow maximization problem in supply chains. First, we have defined and modeled it, then, considering its complex structure, we have obtained a suitable approximate solution for it by using a meta-heuristic method.