The Transportation Problem can be solved with a simplex algorithm, but it's time-consuming.

I'm wondering if there exists a specific Python-implemented algorithm with low complexity.

  • $\begingroup$ I’m having the same question now.... which algorithms did you end up using? $\endgroup$ – ElLl Jan 15 at 14:56

You could try to solve it as a min cost flow problem.

NetworkX is a package for graph algorithms and has algorithms for this implemented. It can easily be installed via pip install networkx.

An minimal working example is given at the bottom of this link:



You can try CBC which uses Dual Simplex (the same algorithm CPLEX & GUROBI use). The easiest way to use that through Python is Pyomo.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.