Two level hierarchical time minimizing transportation problem

A two level hierarchical balanced time minimizing transportation problem is considered in this paper. The whole set of source-destination links consists of two disjoint partitions namely Level-I links and Level-II links. Some quantity of a homogeneous product is first shipped from sources to destinations by Level-I decision maker using only Level-I links, and on its completion the Level-II decision maker transports the remaining quantity of the product in an optimal fashion using only Level-II links. Transportation is assumed to be done in parallel in both the levels. The aim is to find that feasible solution for Level-I decision maker corresponding to which the optimal feasible solution for Level-II decision maker is such that the sum of shipment times in Level-I and Level-II is the least. To obtain the global optimal feasible solution of this non-convex optimization problem, related balanced time minimizing transportation problems are defined. Based upon the optimal feasible solutions of these related problems, standard cost minimizing transportation problems are constructed whose optimal feasible solutions provide various pairs for shipment times for Level-I and Level-II decision makers. The best out of these pairs is finally selected. Being dependent upon solutions of a finite number of balanced time minimizing and cost minimizing transportation problems, the proposed algorithm is a polynomial bound algorithm. The developed algorithm has been implemented and tested on a variety of test problems and performance is found to be quite encouraging.

[1]  T. Friesz,et al.  Spatial competition facility location models: Definition, formulation and solution approach , 1986 .

[2]  Robert E. Tarjan,et al.  Improved Algorithms for Bipartite Network Flow , 1994, SIAM J. Comput..

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

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

[5]  John G. Klincewicz,et al.  Solving a Freight Transport Problem Using Facility Location Techniques , 1990, Oper. Res..

[6]  Jerome Bracken,et al.  Defense Applications of Mathematical Programs with Optimization Problems in the Constraints , 1974, Oper. Res..

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

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

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

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

[11]  Jonathan F. Bard,et al.  Coordination of a multidivisional organization through two levels of management , 1983 .

[12]  J. Bard.  Regulating nonnuclear industrial wastes by hazard classification , 1983 .

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

[14]  Nguyen V. Thoai,et al.  Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes , 2000, J. Glob. Optim..

[15]  J. Bracken,et al.  Production and marketing decisions with multiple objectives in a competitive environment , 1978 .

[16]  Reiner Horst,et al.  An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

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

[18]  Caroline S. Fisk,et al.  A Conceptual Framework for Optimal Transportation Systems Planning with Integrated Supply and Demand Models , 1986, Transp. Sci..

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

[20]  Takahito Kuno,et al.  A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost , 1996, J. Glob. Optim..

[21]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[22]  Terry L. Friesz,et al.  TRANSPORTATION NETWORK EQUILIBRIUM, DESIGN AND AGGREGATION: KEY DEVELOPMENTS AND RESEARCH OPPORTUNITIES. IN: THE AUTOMOBILE , 1985 .

[23]  Terry L. Friesz,et al.  Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..

[24]  Peter Värbrand,et al.  A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables , 1996, Math. Program..

[25]  T. Başar,et al.  Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems , 1979 .

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

[27]  T. Friesz,et al.  Algorithms for Spatially Competitive Network Facility-Location , 1988 .

[28]  P. Marcotte.  Network Optimization with Continuous Control Parameters , 1983 .

[29]  T. Satoh,et al.  Economic Dispatch with Network Security Constraints Using Parametric Quadratic Programming , 1982, IEEE Transactions on Power Apparatus and Systems.