Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10523850 | Discrete Optimization | 2005 | 16 Pages |
Abstract
We investigate the solution of large-scale instances of the capacitated and uncapacitated facility location problems. Let n be the number of customers and m the number of potential facility sites. For the uncapacitated case we solved instances of size mÃn=3000Ã3000; for the capacitated case the largest instances were 1000Ã1000. We use heuristics that produce a feasible integer solution and use a Lagrangian relaxation to obtain a lower bound on the optimal value. In particular, we present new heuristics whose gap from optimality was generally below 1%. The heuristics combine the volume algorithm and randomized rounding. For the uncapacitated facility location problem, our computational experiments show that our heuristic compares favorably against DUALOC.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Francisco Barahona, Fabián A. Chudak,