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

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

0.00 Avg rating0 Votes
Article ID: iaor20001374
Country: Netherlands
Volume: 113
Issue: 3
Start Page Number: 544
End Page Number: 559
Publication Date: Mar 1999
Journal: European Journal of Operational Research
Authors: , ,
Keywords: allocation: resources, programming: integer, programming: branch and bound
Abstract:

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 satisfied, 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 efficient.

Reviews

Required fields are marked *. Your email address will not be published.