A fast polynomial time algorithm for logistics network flows

For a multi-tiered logistics network containing the manufacturers, distributors and consumers, in this paper we present a fast polynomial time algorithm to find product flow with the minimum congestion by shipping products from manufacturers to distributors and from distributors to consumers. Global convergence is delivered for the proposed algorithm. The values of congestion and the potential function can be successfully decreased by conducting the proposed algorithm in logistics networks. Numerical computations and comparisons with well-known linear programming package CPLEX on large-scale logistics networks are performed where significant savings in computations are gained from the proposed algorithm.