An exact algorithm for the capacitated facility location problems with single sourcing

✍ Scribed by Kaj Holmberg; Mikael Rönnqvist; Di Yuan

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 168 KB
• Volume: 113
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(98)00008-3

✦ Synopsis

Facility location problems are often encountered in many areas such as distribution, transportation and telecommunication. We describe a new solution approach for the capacitated facility location problem in which each customer is served by a single facility. An important class of heuristic solution methods for these problems are Lagrangian heuristics which have been shown to produce high quality solutions and at the same time be quite robust. A primal heuristic, based on a repeated matching algorithm which essentially solves a series of matching problems until certain convergence criteria are satis®ed, is incorporated into the Lagrangian heuristic. Finally, a branch-and-bound method, based on the Lagrangian heuristic is developed, and compared computationally to the commercial code CPLEX. The computational results indicate that the proposed method is very ecient.