A new approach for solving multi-commodity and bounded network transportation problem

DOI10.22055/JAMM.2021.37258.1926MaRDI QIDQ5037367zbMATHOpenAlexFDO

Authors Milad Habibinia, Hadi Basirzadeh

Publication date 28 February 2022

Full work available at URL https://jamm.scu.ac.ir/article_16994_c8fe443eb18a756b2b90ac5afdc89fa6.pdf

zbMATH Keywords

optimizationbounded transportation problemmulti commodity network flows

Mathematics Subject Classification ID

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

Recommendations

• Iterative functional modification method for solving a transportation problem
• Preface: Special issue on network optimization in transportation, logistics, and industry
• Computer Algebra and Geometric Algebra with Applications
• A branch and bound procedure for cost minimizing bulk transportation problem
• scientific article; zbMATH DE number 3922335

Cited in

(8)

• Algorithms and Computation
• Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
• A new way for solving transportation issues based on the exponential distribution and the contraharmonic mean
• scientific article; zbMATH DE number 67673 (Why is no real title available?)
• A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies
• A two-stage data envelopment analysis approach to solve extended transportation problem with non-homogenous costs
• scientific article; zbMATH DE number 912071 (Why is no real title available?)
• A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem

This page was built for publication: A new approach for solving multi-commodity and bounded network transportation problem

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