A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem

Abstract The THTMTP (two-level hierarchical time minimization transportation problem) is an important problem arising in industries. In literature, there are only two approaches with shortcomings to solve the problem. In this paper, the THTMTP is formulated as a mathematical model applicable to the case in which the total available supply at the sources is no less than the total demand at the destinations. A feasible flow-based iterative algorithm named THTMTP-A is proposed to solve the THTMTP by constructing network with lower and upper arc capacities. It is proved that the THTMTP-A algorithm can find the optimal solution to the THTMTP in a polynomial time. The proposed THTMTP-A algorithm has good performance in terms of computer implementation, computational time and required memory for computation, and hence overcomes successfully the shortcomings of the two existing approaches. Computational experiments validate that the THTMTP-A algorithm is an efficient and robust method to solve the THTMTP, and can serve as efficient tool to solve other related optimization problems.

[1]  M. C. Puri,et al.  A min max problem , 1980, Z. Oper. Research.

[2]  Fanrong Xie,et al.  On Capacitated Transportation Problem with Bounds on Rim Conditions , 2009, 2009 International Conference on New Trends in Information and Service Science.

[3]  Sonia,et al.  Two level hierarchical time minimizing transportation problem , 2004 .

[4]  Robert Garfinkel,et al.  The bottleneck transportation problem , 1971 .

[5]  Peter Kleinschmidt,et al.  A strongly polynomial algorithm for the transportation problem , 1995, Math. Program..

[6]  Wlodzimierz Szwarc,et al.  Some remarks on the time transportation problem , 1971 .

[7]  Alan Frieze.  Bottleneck Linear Programming , 1975 .

[8]  Takahito Kuno,et al.  A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem , 1997, J. Glob. Optim..

[9]  Anuj Sharma,et al.  A priority based assignment problem , 2016 .

[10]  Yuchen Jia,et al.  Duration & Cost Optimization for Transportation Problem , 2012 .

[11]  Makoto Yamashita,et al.  Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables , 2013, J. Glob. Optim..

[12]  D. Klingman,et al.  The Transportation Problem with Mixed Constraints , 1974 .

[13]  Sonia,et al.  Two-stage time minimizing assignment problem , 2008 .

[14]  S. Molla‐Alizadeh‐Zavardehi,et al.  Genetic and differential evolution algorithms for the allocation of customers to potential distribution centers in a fuzzy environment , 2014 .

[15]  Prabhjot Kaur,et al.  An iterative algorithm for two level hierarchical time minimization transportation problem , 2015, Eur. J. Oper. Res..

[16]  Franz Rendl,et al.  Lexicographic bottleneck problems , 1991, Oper. Res. Lett..

[17]  Gautam Appa,et al.  The Transportation Problem and its Variants , 1973 .

[18]  Hanif D. Sherali,et al.  Equivalent weights for lexicographic multi-objective programs: Characterizations and computations , 1982 .

[19]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[20]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[21]  K. D. Sharma,et al.  A new dual based procedure for the transportation problem , 2000, Eur. J. Oper. Res..

[22]  T. Koopmans.  Optimum Utilization of the Transportation System , 1949 .

[23]  Christoph Schnörr,et al.  A Hierarchical Approach to Optimal Transport , 2013, SSVM.

[24]  R. Ahuja.  Algorithms for the minimax transportation problem , 1986 .

[25]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[26]  D. R. Fulkerson,et al.  A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .

[27]  Ingram Olkin,et al.  Mass transportation problems with capacity constraints , 1999, Journal of Applied Probability.

[28]  Peter L. Hammer.  Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem” , 1971 .

[29]  Takahito Kuno,et al.  A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems , 2000, J. Glob. Optim..

[30]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[31]  H. M. Wagner.  On a Class of Capacitated Transportation Problems , 1959 .

[32]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[33]  Muhammad Munir Butt,et al.  An upper bound on the minimal total cost of the transportation problem with varying demands and supplies , 2017 .

[34]  Peter L. Hammer,et al.  Time‐minimizing transportation problems , 1969 .

[35]  Guangxing Zeng,et al.  On Minimum Duration Project Schedule , 2010, 4th International Conference on New Trends in Information Science and Service Science.

[36]  M. C. Puri,et al.  On lexicographic optimal solutions in transportation problems , 1997 .

[37]  M. E. B. Brigden.  A Variant of the Transportation Problem in Which the Constraints are of Mixed Type , 1974 .

[38]  Takahito Kuno,et al.  A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST , 2005 .

[39]  Fanrong Xie,et al.  Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm , 2012, Comput. Ind. Eng..

[40]  Shiang-Tai Liu,et al.  The total cost bounds of the transportation problem with varying demand and supply , 2003 .

[41]  Joseph B. Mazzola,et al.  An algorithm for the bottleneck generalized assignment problem , 1993, Comput. Oper. Res..

[42]  U. Klanšek,et al.  Solving the nonlinear transportation problem by global optimization , 2010 .

[43]  Satya Prakash.  On minimizing the duration of transportation , 1982 .

[44]  Kalpana Dahiya,et al.  Capacitated transportation problem with bounds on RIM conditions , 2007, Eur. J. Oper. Res..

[45]  Veena Adlakha,et al.  On lower bounds for the fixed charge problem , 2014, Comput. Oper. Res..

[46]  M. A. Hoque,et al.  A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies , 2014, Eur. J. Oper. Res..

[47]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..