ISSN:
1432-5217
Keywords:
Facility location
;
Mixed integer programming
;
Benders' decomposition and Paretooptimality
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract Discrete facility location problems are attractive candidates for decomposition procedures since two types of decisions have to be performed: on the one hand the yes/no-decision where to locate the facilities, on the other hand the decision how to allocate the demand to the selected facilities. Nevertheless, Benders' decomposition seems to have a rather slow convergence behaviour when applied for solving location problems. In the following, a procedure will be presented for strengthening the Benders' cuts for the capacitated facility location problem. Computational results show the efficiency of the modified Benders' decomposition algorithm. Furthermore, the paretooptimality of the strengthened Benders' cuts in the sense of [Magnanti and Wong 1990] is shown under a weak assumption.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01194335
Permalink