Solving Minimum Cost Multi-Commodity Network Flow Problem Using Lexicographic Goal Programming Approach
Abstract
No abstract recorded for this item.
No abstract recorded for this item.
In this paper, a multi-objective multi-period multi-product supply chain network design problem is introduced. This problem is modeled using a multi-objective mixed integer mathematical programming. The objectives are maximizing the total profit of logistics, maximizing service l
The multi-commodity network flow problem (MCNF) consists in routing a set of commodities through capacitated at minimum cost and is relevant for containers liner shipping networks. As commodity transit times are often critical factor, the literature has introduced hard limits on
In this paper, we describe a dynamic programming approach to find optimal trees to the singlesource minimum cost network flow problem with general nonlinear costs. This class of problems is known to be NP-Hard and there is a scarcity of methods to address them. The algorithms pre
In this paper, we propose a method to solve the Nonlinear Multicommodity Network Flow (NMNF) Problem. We have combined this method with a projected-Jacobi (PJ) method and a duality based method possessing decomposition effects. With the decomposition, our method can be parallel p