A Greedy Algorithm for Solving Ordinary Transportation Problem with Capacity Constraints

Posted: 10 Jan 2017

See all articles by Fang Liu

Fang Liu

Durham University Business School

Date Written: January 10, 2017

Abstract

Consider the ordinary transportation problem with the objective to minimize the cost of transporting a single commodity from M warehouses to N demand locations. Each warehouse i has a finite capacity ki. We convert the above problem into a dual problem and construct a greedy algorithm to solve it.

Suggested Citation

Liu, Fang, A Greedy Algorithm for Solving Ordinary Transportation Problem with Capacity Constraints (January 10, 2017). Available at SSRN: https://ssrn.com/abstract=2896544 or http://dx.doi.org/10.2139/ssrn.2896544

Fang Liu (Contact Author)

Durham University Business School ( email )

Mill Hill Lane
Durham, DH1 3LB
United Kingdom

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
823
PlumX Metrics