Abstract
The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 67-96 |
| Number of pages | 30 |
| Journal | Annals of Operations Research |
| Volume | 20 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1989 |
| Externally published | Yes |
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research