An iterative algorithm for two level hierarchical time minimization transportation problem

DOI10.1016/J.EJOR.2015.03.034MaRDI QIDQ319851zbMATH OpenOpenAlexFDO

Authors Vanita Verma, Prabhjot Kaur, 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 optimizationtransportation problempolynomial algorithmhierarchical optimizationconcave minimization

Mathematics Subject Classification ID

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

Recommendations

• A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
• Two level hierarchical time minimizing transportation problem
• A solution technique for capacitated two-level hierarchical time minimization transportation problem
• An iterative solution technique for capacitated two-stage time minimization transportation problem
• Bilevel time minimizing transportation problem
• An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem
• Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem
• An improved algorithm for two stage time minimization assignment problem
• scientific article; zbMATH DE number 4010209
• Publication:4886271

Cites work

• scientific article; zbMATH DE number 3869061 (Why is no real title available?)
• scientific article; zbMATH DE number 4047438 (Why is no real title available?)
• scientific article; zbMATH DE number 3586817 (Why is no real title available?)
• scientific article; zbMATH DE number 486947 (Why is no real title available?)
• scientific article; zbMATH DE number 810516 (Why is no real title available?)
• scientific article; zbMATH DE number 3231710 (Why is no real title available?)
• A Lagrangian based branch-and-bound algorithm for production-transportation problems
• A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A Variant of the Transportation Problem in Which the Constraints are of Mixed Type
• A min max problem
• A new dual based procedure for the transportation problem
• A procedure for time minimization transportation problem
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
• A strongly polynomial algorithm for the transportation problem
• Algorithms for the minimax transportation problem
• An algorithm for the bottleneck generalized assignment problem
• Bottleneck Linear Programming
• Capacitated transportation problem with bounds on rim conditions
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Lexicographic bottleneck problems
• Linear bottleneck transportation problems
• Mass transportation problems with capacity constraints
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• On a class of capacitated transportation problems
• On lexicographic optimal solutions in transportation problems
• On minimizing the duration of transportation
• Scale space and variational methods in computer vision. 4th international conference, SSVM 2013, Schloss Seggau, Leibnitz, Austria, June 2--6, 2013. Proceedings
• Solving a transportation problem with mixed constraints and a specified transportation flow
• Some remarks on the time transportation problem
• The Transportation Problem and its Variants
• The Transportation Problem with Mixed Constraints
• The bottleneck transportation problem
• Time‐minimizing transportation problems
• Two level hierarchical time minimizing transportation problem

Cited in

(13)

• Bilevel time minimizing transportation problem
• A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
• Profit maximization multi-item just-in-time solid transportation problem with budget constraints based on carbon emission
• A solution technique for capacitated two-level hierarchical time minimization transportation problem
• Multi-objective two-stage grey transportation problem using utility function with goals
• An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions
• Two level hierarchical time minimizing transportation problem
• An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow
• 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
• The multi-objective multi-item just-in-time transportation problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A priority based time minimization transportation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319851)