The DOI matches its Crossref record.
Multicommodity Distribution System Design by Benders Decomposition
Abstract
A commonly occurring problem in distribution system design is the optimal location of intermediate distribution facilities between plants and customers. A multi-commodity capacitated single-period version of this problem is formulated as a mixed integer linear program. A solution technique based on Benders Decomposition is developed, implemented, and successfully applied to a real problem for a major food firm with 17 commodity classes, 14 plants, 45 possible distribution center sites, and 121 customer zones. An essentially optimal solution was found and proven with a surprisingly small number of Benders cuts. Some discussion is given concerning why this problem class appears to be so amenable to solution by Benders' method, and also concerning what we feel to be the proper professional use of the present computational technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Coordinated supply chain management
Thomas, D. J., & Griffin, P. M. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(96)00098-7 · Cited by 1,268
A stochastic programming approach for supply chain network design under uncertainty
Santoso, T., Ahmed, S., Goetschalckx, M., & Shapiro, A. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.01.046 · Cited by 1,131
Facility location under uncertainty: a review
Snyder, L. V. (2006) · IIE Transactions · doi:10.1080/07408170500216480 · Cited by 1,019
Lagrangian Relaxation for Integer Programming
Geoffrion, A. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_9 · Cited by 974
Self-citationFacility location models for distribution system design
Klose, A., & Drexl, A. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2003.10.031 · Cited by 965
The design of robust value-creating supply chain networks: A critical review
Klibi, W., Martel, A., & Guitouni, A. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.06.011 · Cited by 870
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Vidal, C. J., & Goetschalckx, M. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)80080-x · Cited by 759
Akkerman, R., Farahani, P., & Grunow, M. (2010) · OR Spectrum · doi:10.1007/s00291-010-0223-2 · Cited by 546
The simple plant location problem: Survey and synthesis
Krarup, J., & Pruzan, P. M. (1983) · European Journal of Operational Research · doi:10.1016/0377-2217(83)90181-9 · Cited by 544
Goetschalckx, M., Vidal, C. J., & Dogan, K. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00142-x · Cited by 482
Models for Supply Chains in E-Business
Swaminathan, J. M., & Tayur, S. R. (2003) · Management Science · doi:10.1287/mnsc.49.10.1387.17309 · Cited by 480
The design of reverse distribution networks: Models and solution procedures
Jayaraman, V., Patterson, R. A., & Rolland, E. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00497-6 · Cited by 473
Melo, M. T., Nickel, S., & Saldanha da Gama, F. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2004.07.005 · Cited by 432
Process industry supply chains: Advances and challenges
Shah, N. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.02.023 · Cited by 364
Pishvaee, M. S., Razmi, J., & Torabi, S. A. (2014) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2014.04.001 · Cited by 298
A genetic algorithm for two-stage transportation problem using priority-based encoding
Gen, M., Altiparmak, F., & Lin, L. (2006) · OR Spectrum · doi:10.1007/s00291-005-0029-9 · Cited by 286
Two-stage fleet assignment model considering stochastic passenger demands
Sherali, H. D., & Zhu, X. (2008) · Operations Research · doi:10.1287/opre.1070.0476 · Cited by 56
Metadata
- Authors
- Geoffrion, A. M., & Graves, G. W.
- Venue
- Management Science
- Published
- 1974-01
- Volume
- 20
- Issue
- 5
- Pages
- 822-844
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W4250535541
- Cited by
- 906
- References
- 0
- FWCI
- 24.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.