Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Cross Decomposition Algorithm for Capacitated Facility Location

A Cross Decomposition Algorithm for Capacitated Facility Location 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Operations Research INFORMS

A Cross Decomposition Algorithm for Capacitated Facility Location

Operations Research , Volume 34 (1): 19 – Feb 1, 1986
20 pages

Loading next page...
 
/lp/informs/a-cross-decomposition-algorithm-for-capacitated-facility-location-ckMY18PwfX

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0030-364X
eISSN
1526-5463
DOI
10.1287/opre.34.1.145
Publisher site
See Article on Publisher Site

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.

Journal

Operations ResearchINFORMS

Published: Feb 1, 1986

Keywords: Keywords : 185 facility location ; 625 cross decomposition for mixed integer programming

There are no references for this article.