A Greedy Algorithm for Solving Ordinary Transportation Problem with Capacity Constraints
Posted: 10 Jan 2017
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: 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
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.