Article ID: | iaor200573 |
Country: | United States |
Volume: | 35 |
Issue: | 3 |
Start Page Number: | 216 |
End Page Number: | 224 |
Publication Date: | Mar 2003 |
Journal: | Algorithmica |
Authors: | Okano H., Hidaka K. |
Keywords: | greedy algorithms |
We developed a new practical optimization method that gives approximate solutions for large-scale real instances of the Uncapacitated Facility Location Problem. The optimization consists of two steps: application of the Greedy-Interchange heuristic using a small subset of warehouse candidates, and application of the newly developed heuristic named Balloon Search that takes account of all warehouse candidates, and runs in