An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions

DOI10.1142/S0217595920500244zbMath1457.90022OpenAlexW3019311129MaRDI QIDQ5149536

Zuoan Li, Fanrong Xie

Publication date: 11 February 2021

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595920500244

zbMATH Keywords

transportationiterative algorithmsminimum cost flownetwork with lower and upper arc capacities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ An alternate approach to solve two-level priority based assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
• An iterative algorithm for two level hierarchical time minimization transportation problem
• On lower bounds for the fixed charge problem
• Capacitated transportation problem with bounds on rim conditions
• The minimal average cost flow problem
• A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
• Concealment measurement and flow distribution of military supply transportation: a double-entropy model
• Two level hierarchical time minimizing transportation problem
• More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions
• Algorithms for solving the single-sink fixed-charge transportation problem
• Mathematical Methods of Organizing and Planning Production
• The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
• CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM
• Probabilistic Analysis of the Capacitated Transportation Problem
• A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
• Postoptimality Analyses of the Transportation Problem
• Mass transportation problems with capacity constraints
• Note—The Distribution Problem with Upper and Lower Bounds on the Node Requirements
• The Distribution of a Product from Several Sources to Numerous Localities

This page was built for publication: An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions