An iterative algorithm for two level hierarchical time minimization transportation problem

DOI10.1016/J.EJOR.2015.03.034zbMath1346.90600OpenAlexW2013613229MaRDI QIDQ319851

Prabhjot Kaur, Vanita Verma, Kalpana Dahiya, Anuj Kumar Sharma

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.034

zbMATH Keywords

global optimizationconcave minimizationpolynomial algorithmtransportation problemhierarchical optimization

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (9)

A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Multi-objective two-stage grey transportation problem using utility function with goals ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions ⋮ A priority based time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ The multi-objective multi-item just-in-time transportation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capacitated transportation problem with bounds on rim conditions
• On minimizing the duration of transportation
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Lexicographic bottleneck problems
• A procedure for time minimization transportation problem
• An algorithm for the bottleneck generalized assignment problem
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
• A new dual based procedure for the transportation problem
• Two level hierarchical time minimizing transportation problem
• A strongly polynomial algorithm for the transportation problem
• Solving a transportation problem with mixed constraints and a specified transportation flow
• Scale space and variational methods in computer vision. 4th international conference, SSVM 2013, Schloss Seggau, Leibnitz, Austria, June 2--6, 2013. Proceedings
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
• Mathematical Methods of Organizing and Planning Production
• On a Class of Capacitated Transportation Problems
• Algorithms for the minimax transportation problem
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A min max problem
• A Variant of the Transportation Problem in Which the Constraints are of Mixed Type
• Bottleneck Linear Programming
• On lexicographic optimal solutions in transportation problems
• Some remarks on the time transportation problem
• The Transportation Problem with Mixed Constraints
• Mass transportation problems with capacity constraints
• Time‐minimizing transportation problems
• The Transportation Problem and its Variants
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• The bottleneck transportation problem
• A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
• A Lagrangian based branch-and-bound algorithm for production-transportation problems

This page was built for publication: An iterative algorithm for two level hierarchical time minimization transportation problem