A Cross Decomposition Algorithm for Capacitated Facility Location

Tony J. Van Roy
Additional contact information
Tony J. Van Roy: Université Catholique de Louvain, Belgium

Operations Research, 1986, vol. 34, issue 1, 145-163

Abstract: We present an implementation of the Cross Decomposition method to solve the capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework that involves successive solutions to a transportation problem and a simple plant location problem. Computational tests on problems with as many as 100 candidate facility locations and 200 customers provide evidence that the approach is superior to several other methods. The specialized Cross Decomposition program is, on a common set of test problems, about ten times faster than several recently developed programs. We also present a simple algorithm to strengthen Benders cuts.

Keywords: 185 facility location; 625 cross decomposition for mixed integer programming (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (53)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.1.145 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:1:p:145-163

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().