Dantzig-Wolfe decomposition for the facility location and production planning problem

•We propose two mathematical models for the facility location and production planning problem.•Item Dantzig-Wolfe decomposition is proposed to improve lower bounds of the studied problem.•We analyze the relationship between these models and Dantzig-Wolfe decomposition reformulations.•The effectivene...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 124; s. 105068
Hlavní autoři:	Wu, Tao, Shi, Zhongshun, Liang, Zhe, Zhang, Xiaoning, Zhang, Canrong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.12.2020 Pergamon Press Inc
Témata:	Benchmarks Column generation Customers Dantzig-Wolfe decomposition Decomposition Facility location Item decomposition Linear programming Lot-sizing Lower bounds Mathematical models Mixed integer programming Operations research Production distribution Production planning Facility location Lot-sizing Column generation Production planning Mixed integer programming Item decomposition Production distribution
ISSN:	0305-0548, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	•We propose two mathematical models for the facility location and production planning problem.•Item Dantzig-Wolfe decomposition is proposed to improve lower bounds of the studied problem.•We analyze the relationship between these models and Dantzig-Wolfe decomposition reformulations.•The effectiveness of the item Dantzig-Wolfe decomposition method is verified by computational tests. There are several mathematical models proposed for the facility location and production planning problem in the literature. However, some of these models disregard what products each customer has ordered and neglect critical production-related constraints and setup decisions while some others do not well define the connection cost between customers and facilities. In this study, we propose two mathematical models to overcome the disadvantages aforementioned, along with their reformulations by item decomposition to improve lower bounds. We demonstrate that the pricing subproblems of the item decomposition are related to uncapacitated lot-sizing problems with the Wagner-Whitin property. This property is employed to enhance the performance of column generation for the item decomposition. Our computational results show that this item decomposition method can improve lower bounds over other classical lower bounding techniques, such as linear programming relaxation and model reformulation. Additionally, we implement the proposed item decomposition method to other benchmark problems in the literature and observe that our proposed method can improve the benchmark solutions with a statistical significance.
AbstractList	There are several mathematical models proposed for the facility location and production planning problem in the literature. However, some of these models disregard what products each customer has ordered and neglect critical production-related constraints and setup decisions while some others do not well define the connection cost between customers and facilities. In this study, we propose two mathematical models to overcome the disadvantages aforementioned, along with their reformulations by item decomposition to improve lower bounds. We demonstrate that the pricing subproblems of the item decomposition are related to uncapacitated lot-sizing problems with the Wagner-Whitin property. This property is employed to enhance the performance of column generation for the item decomposition. Our computational results show that this item decomposition method can improve lower bounds over other classical lower bounding techniques, such as linear programming relaxation and model reformulation. Additionally, we implement the proposed item decomposition method to other benchmark problems in the literature and observe that our proposed method can improve the benchmark solutions with a statistical significance. •We propose two mathematical models for the facility location and production planning problem.•Item Dantzig-Wolfe decomposition is proposed to improve lower bounds of the studied problem.•We analyze the relationship between these models and Dantzig-Wolfe decomposition reformulations.•The effectiveness of the item Dantzig-Wolfe decomposition method is verified by computational tests. There are several mathematical models proposed for the facility location and production planning problem in the literature. However, some of these models disregard what products each customer has ordered and neglect critical production-related constraints and setup decisions while some others do not well define the connection cost between customers and facilities. In this study, we propose two mathematical models to overcome the disadvantages aforementioned, along with their reformulations by item decomposition to improve lower bounds. We demonstrate that the pricing subproblems of the item decomposition are related to uncapacitated lot-sizing problems with the Wagner-Whitin property. This property is employed to enhance the performance of column generation for the item decomposition. Our computational results show that this item decomposition method can improve lower bounds over other classical lower bounding techniques, such as linear programming relaxation and model reformulation. Additionally, we implement the proposed item decomposition method to other benchmark problems in the literature and observe that our proposed method can improve the benchmark solutions with a statistical significance.
ArticleNumber	105068
Author	Shi, Zhongshun Wu, Tao Liang, Zhe Zhang, Canrong Zhang, Xiaoning
Author_xml	– sequence: 1 givenname: Tao orcidid: 0000-0001-7954-485X surname: Wu fullname: Wu, Tao email: danielwu9999@gmail.com organization: School of Economics & Management, Tongji University, Shanghai 200092, China – sequence: 2 givenname: Zhongshun surname: Shi fullname: Shi, Zhongshun email: tzshi@utk.edu organization: Department of Industrial and Systems Engineering, University of Tennessee Knoxville, Knoxville, TN 37996, USA – sequence: 3 givenname: Zhe orcidid: 0000-0001-5774-2791 surname: Liang fullname: Liang, Zhe email: liangzhe@tongji.edu.cn organization: School of Economics & Management, Tongji University, Shanghai 200092, China – sequence: 4 givenname: Xiaoning surname: Zhang fullname: Zhang, Xiaoning email: cexzhang@tongji.edu.cn organization: School of Economics & Management, Tongji University, Shanghai 200092, China – sequence: 5 givenname: Canrong surname: Zhang fullname: Zhang, Canrong email: crzhang@sz.tsinghua.edu.cn organization: Logistics Engineering and Simulation Laboratory, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
BookMark	eNp9kE1PwzAMhiM0JDbgB3CrxLkjaZumFSc0PqVJXJg4Rm7qjFRdMtIMafx62pUD4jBfbMd-Yr3vjEyss0jIFaNzRll-08yV8_OEJkPPaV6ckClNKY8pz4rJn_qMzLquoX2IhE3J6h5s-Dbr-N21GqMaldtsXWeCcTbSzkfhAyMNyrQm7KPWKThMwNbR1rt6pw7ttgVrjV0Pb1WLmwtyqqHt8PI3n5PV48Pb4jlevj69LO6WsUq5CDEoURVJpigKwCSHqhRlrqsyqzVygFqLpGKIpci0rrDKihLLXPE0SzVogCI9J9fjv_3dzx12QTZu521_Uiac8l5hyYYtNm4p77rOo5Zbbzbg95JRObgnG9m7Jwf35Ohez4h_jDLhoD14MO1R8nYksRf-ZdDLThm0CmvjUQVZO3OE_gHhR437
CitedBy_id	crossref_primary_10_1287_ijoc_2023_0339 crossref_primary_10_1007_s43069_024_00350_8 crossref_primary_10_1109_TEM_2023_3275569 crossref_primary_10_1016_j_cor_2021_105347 crossref_primary_10_1111_itor_13423 crossref_primary_10_1016_j_omega_2021_102581 crossref_primary_10_3390_su142215204 crossref_primary_10_1016_j_ejor_2021_11_020 crossref_primary_10_1007_s10257_022_00551_w crossref_primary_10_3390_su15086588 crossref_primary_10_1016_j_eswa_2022_117916 crossref_primary_10_1016_j_compchemeng_2024_108725 crossref_primary_10_1016_j_cor_2025_106981 crossref_primary_10_1080_00207543_2024_2406994
Cites_doi	10.1287/opre.1110.0965 10.1016/j.orl.2005.05.009 10.1287/mnsc.5.1.89 10.1287/trsc.8.3.217 10.1287/moor.1040.0125 10.1016/j.ejor.2019.03.001 10.1007/BF02680552 10.1287/trsc.37.1.40.12823 10.1287/ijoc.2016.0712 10.1287/moor.26.3.591.10586 10.1287/opre.1040.0140 10.1016/j.omega.2018.07.006 10.1080/10556780902992837 10.1007/BFb0120690 10.1287/moor.18.4.767 10.1016/j.trb.2019.01.003 10.1287/mnsc.29.10.1126 10.1287/ijoc.2017.0746 10.1287/opre.51.6.922.24914 10.1287/mnsc.1050.0410 10.1002/nav.20458 10.1016/S0166-218X(00)00320-6 10.1287/ijoc.2014.0636 10.1016/0360-8352(95)00021-R 10.1287/opre.34.1.145 10.1287/ijoc.2017.0777 10.1287/mnsc.11.9.874 10.1287/trsc.30.4.291 10.1016/j.swevo.2011.02.002 10.1016/j.ejor.2005.03.078 10.1287/opre.35.6.832 10.1287/mnsc.4.2.115 10.1109/TASE.2009.2039134 10.1287/mnsc.35.3.353 10.1287/opre.46.3.316 10.1016/j.cor.2015.04.015 10.1287/ijoc.2016.0691 10.1016/j.ijpe.2015.08.024 10.1016/j.orl.2003.06.001 10.1002/net.20315 10.1016/0272-6963(85)90009-9 10.1287/opre.19.4.946 10.1016/j.cor.2018.05.024 10.1287/opre.1070.0404
ContentType	Journal Article
Copyright	2020 Elsevier Ltd Copyright Pergamon Press Inc. Dec 2020
Copyright_xml	– notice: 2020 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Dec 2020
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.cor.2020.105068
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	0305-0548
ExternalDocumentID	10_1016_j_cor_2020_105068 S0305054820301854
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AAXKI AAXUO AAYFN AAYOK ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD 7SC 8FD AGCQF JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c357t-ac7b824c0e7ae26ab9796fb94dfe5aadf72b1ee974ffbeb489e96c5343fafaa83
ISICitedReferencesCount	17
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000571468600007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Wed Aug 13 09:40:20 EDT 2025 Sat Nov 29 07:20:24 EST 2025 Tue Nov 18 21:31:43 EST 2025 Tue Dec 03 03:45:22 EST 2024
IsPeerReviewed	true
IsScholarly	true
Keywords	Facility location Lot-sizing Column generation Production planning Mixed integer programming Item decomposition Production distribution
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c357t-ac7b824c0e7ae26ab9796fb94dfe5aadf72b1ee974ffbeb489e96c5343fafaa83
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-5774-2791 0000-0001-7954-485X
PQID	2505721918
PQPubID	45870
ParticipantIDs	proquest_journals_2505721918 crossref_primary_10_1016_j_cor_2020_105068 crossref_citationtrail_10_1016_j_cor_2020_105068 elsevier_sciencedirect_doi_10_1016_j_cor_2020_105068
PublicationCentury	2000
PublicationDate	2020-12-01
PublicationDateYYYYMMDD	2020-12-01
PublicationDate_xml	– month: 12 year: 2020 text: 2020-12-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Computers & operations research
PublicationYear	2020
Publisher	Elsevier Ltd Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc
References	Neves-Moreira, Almada-Lobo, Cordeau, Guimaraes, Jans (b0125) 2019; 86 Akartunali, Fragkos, Miller, Wu (b0005) 2016; 28 Romeijn, Sharkey, Shen, Zhang (b0160) 2010; 55 Zheng, Yin, Zhang (b0235) 2019; 21 Manne (b0120) 1958; 4 Vanderbeck, Savelsbergh (b0190) 2006; 34 Contreras, Cordeau, Laporte (b0030) 2011; 59 Fiorotto, Araujo, Jans (b0065) 2015; 63 Geoffrion (b0085) 1974; 2 Derrac, García, Molina, Herrera (b0040) 2011; 1 Zhang, Chen, Ye (b0230) 2005; 30 Trigeiro, Thomas, John (b0185) 1989; 35 Eppen, Martin (b0055) 1987; 35 Garfinkel, Neebe, Rao (b0080) 1974; 8 Liang, Z., He, Y., Wu, T., Zhang, C., 2015. An informative column generation and decomposition method for a production planning and facility location problem. Int. J. Prod. Econ. 170(A), 88–96. de Araujo, Reyck, Degraeve, Fragkos, Jans (b0010) 2015; 27 (b0045) 2005; vol. 41 Fragkos, Degraeve, Reyck (b0070) 2016; 28 Degraeve, Jans (b0035) 2007; 55 Romeijn, Morales (b0155) 2001; 112 Wu, Xiao, Zhang, He, Liang (b0225) 2018; 98 Shu, Teo, Shen (b0180) 2005; 53 Billington, McClain, Thomas (b0025) 1983; 29 Barnhart, Johnson, Nemhauser, Savelsvergh, Vance (b0020) 1998; 46 Wu, Akartunalı, Jans, Liang (b0210) 2017; 29 Barahona, Jensen (b0015) 1998; 83 Pereira, Wolsey (b0130) 2001; 26 Wu, Shi, Duffie (b0220) 2010; 7 Sharkey, Geunes, Romeijn, Shen (b0170) 2011; 58 Klose, Görtz (b0105) 2007; 179 Wagner, Whitin (b0195) 1958; 5 Jans, Degraeve (b0095) 2004; 32 Wu, Liang, Zhang (b0215) 2018; 30 Dzielinski, Gomory (b0050) 1965; 11 Shen, Coullard, Daskin (b0175) 2003; 37 Klose, Drexl (b0100) 2003; 51 Wolsey (b0205) 1998 Freling, Romeijn, Morales, Wagelmans (b0075) 2003; 51 Lasdon, Terjung (b0110) 1971; 19 (b0145) 2006 Pochet, Wolsey (b0150) 1993; 18 Wei, Qi, Wu, Zhang (b0200) 2019; 277 Evans (b0060) 1985; 5 Pimentel, Alvelos, Carvalho (b0135) 2010; 25 Roy (b0165) 1986; 34 Pirkul, Jayaraman (b0140) 1996; 30 Hindi (b0090) 1995; 28 10.1016/j.cor.2020.105068_b0115 Derrac (10.1016/j.cor.2020.105068_b0040) 2011; 1 Pochet (10.1016/j.cor.2020.105068_b0150) 1993; 18 Wu (10.1016/j.cor.2020.105068_b0220) 2010; 7 Shu (10.1016/j.cor.2020.105068_b0180) 2005; 53 Lasdon (10.1016/j.cor.2020.105068_b0110) 1971; 19 Akartunali (10.1016/j.cor.2020.105068_b0005) 2016; 28 Shen (10.1016/j.cor.2020.105068_b0175) 2003; 37 Zhang (10.1016/j.cor.2020.105068_b0230) 2005; 30 Zheng (10.1016/j.cor.2020.105068_b0235) 2019; 21 Pimentel (10.1016/j.cor.2020.105068_b0135) 2010; 25 Pirkul (10.1016/j.cor.2020.105068_b0140) 1996; 30 Jans (10.1016/j.cor.2020.105068_b0095) 2004; 32 de Araujo (10.1016/j.cor.2020.105068_b0010) 2015; 27 Garfinkel (10.1016/j.cor.2020.105068_b0080) 1974; 8 Trigeiro (10.1016/j.cor.2020.105068_b0185) 1989; 35 Vanderbeck (10.1016/j.cor.2020.105068_b0190) 2006; 34 Klose (10.1016/j.cor.2020.105068_b0100) 2003; 51 Roy (10.1016/j.cor.2020.105068_b0165) 1986; 34 Wolsey (10.1016/j.cor.2020.105068_b0205) 1998 Wu (10.1016/j.cor.2020.105068_b0215) 2018; 30 Evans (10.1016/j.cor.2020.105068_b0060) 1985; 5 Romeijn (10.1016/j.cor.2020.105068_b0160) 2010; 55 Manne (10.1016/j.cor.2020.105068_b0120) 1958; 4 (10.1016/j.cor.2020.105068_b0145) 2006 Pereira (10.1016/j.cor.2020.105068_b0130) 2001; 26 Contreras (10.1016/j.cor.2020.105068_b0030) 2011; 59 Barahona (10.1016/j.cor.2020.105068_b0015) 1998; 83 Hindi (10.1016/j.cor.2020.105068_b0090) 1995; 28 Romeijn (10.1016/j.cor.2020.105068_b0155) 2001; 112 Klose (10.1016/j.cor.2020.105068_b0105) 2007; 179 Wagner (10.1016/j.cor.2020.105068_b0195) 1958; 5 Billington (10.1016/j.cor.2020.105068_b0025) 1983; 29 Neves-Moreira (10.1016/j.cor.2020.105068_b0125) 2019; 86 Sharkey (10.1016/j.cor.2020.105068_b0170) 2011; 58 Barnhart (10.1016/j.cor.2020.105068_b0020) 1998; 46 Dzielinski (10.1016/j.cor.2020.105068_b0050) 1965; 11 Fiorotto (10.1016/j.cor.2020.105068_b0065) 2015; 63 Geoffrion (10.1016/j.cor.2020.105068_b0085) 1974; 2 Freling (10.1016/j.cor.2020.105068_b0075) 2003; 51 Wei (10.1016/j.cor.2020.105068_b0200) 2019; 277 Wu (10.1016/j.cor.2020.105068_b0210) 2017; 29 Eppen (10.1016/j.cor.2020.105068_b0055) 1987; 35 Wu (10.1016/j.cor.2020.105068_b0225) 2018; 98 Fragkos (10.1016/j.cor.2020.105068_b0070) 2016; 28 (10.1016/j.cor.2020.105068_b0045) 2005; vol. 41 Degraeve (10.1016/j.cor.2020.105068_b0035) 2007; 55
References_xml	– volume: 35 start-page: 353 year: 1989 end-page: 366 ident: b0185 article-title: Capacitated lot sizing with setup times publication-title: Manage. Sci. – volume: 35 start-page: 832 year: 1987 end-page: 848 ident: b0055 article-title: Solving multi-item lot-sizing problems using variable redefinition publication-title: Oper. Res. – volume: 98 start-page: 149 year: 2018 end-page: 164 ident: b0225 article-title: The green capacitated multi-item lot sizing problem with parallel machines publication-title: Comput. Oper. Res. – volume: 28 start-page: 709 year: 1995 end-page: 719 ident: b0090 article-title: Computationally efficient solution of the multi-item, capacitated lot-sizing problem publication-title: Comput. Ind. Eng. – year: 1998 ident: b0205 article-title: Integer Programming. volume ISBN 0-471-28366-5 of Wiley-Interscience series in discrete mathematics and optimization publication-title: Wiley – volume: 11 start-page: 874 year: 1965 end-page: 890 ident: b0050 article-title: Optimal programming of lot sizes, inventory and labor allocations publication-title: Manage. Sci. – volume: 2 start-page: 82 year: 1974 end-page: 114 ident: b0085 article-title: Lagrangean relaxation for integer programming publication-title: Math. Program. Study – volume: 26 start-page: 591 year: 2001 end-page: 600 ident: b0130 article-title: On the Wagner-Whitin lot-sizing polyhedron publication-title: Math. Oper. Res. – volume: 51 start-page: 1689 year: 2003 end-page: 1705 ident: b0100 article-title: Lower bounds for the capacitated facility location problem based on column generation publication-title: Manage. Sci. – volume: 112 start-page: 301 year: 2001 end-page: 328 ident: b0155 article-title: A probabilistic analysis of the multi-period single-sourcing problem publication-title: Discrete Appl. Math. – volume: 37 start-page: 40 year: 2003 end-page: 55 ident: b0175 article-title: A joint location-inventory model publication-title: Transp. Sci. – volume: 28 start-page: 465 year: 2016 end-page: 482 ident: b0070 article-title: A horizon decomposition approach for the capacitated lot-sizing problem with setup times publication-title: INFORMS J. Comput. – volume: 32 start-page: 185 year: 2004 end-page: 195 ident: b0095 article-title: Improved lower bounds for the capacitated lot sizing problem with setup times publication-title: Oper. Res. Lett. – volume: vol. 41 year: 2005 ident: b0045 publication-title: Column Generation – volume: 34 start-page: 296 year: 2006 end-page: 306 ident: b0190 article-title: A generic view of Dantzig-Wolfe decomposition in mixed integer programming publication-title: Oper. Res. Lett. – reference: Liang, Z., He, Y., Wu, T., Zhang, C., 2015. An informative column generation and decomposition method for a production planning and facility location problem. Int. J. Prod. Econ. 170(A), 88–96. – volume: 58 start-page: 419 year: 2011 end-page: 436 ident: b0170 article-title: Exact algorithms for integrated facility location and production planning problems publication-title: Naval Res. Logist. – volume: 51 start-page: 922 year: 2003 end-page: 939 ident: b0075 article-title: A branch-and-price algorithm for the multiperiod single-sourcing problem publication-title: Oper. Res. – volume: 34 start-page: 145 year: 1986 end-page: 163 ident: b0165 article-title: A cross decomposition algorithm for capacitated facility location publication-title: Oper. Res. – volume: 83 start-page: 101 year: 1998 end-page: 111 ident: b0015 article-title: Plant location with minimum inventory publication-title: Math. Program. – volume: 46 start-page: 316 year: 1998 end-page: 329 ident: b0020 article-title: Branch-and-price: column generation for solving huge integer programs publication-title: Oper. Res. – volume: 8 start-page: 217 year: 1974 end-page: 236 ident: b0080 article-title: An algorithm for the M-median plant location problem publication-title: Transp. Sci. – volume: 63 start-page: 136 year: 2015 end-page: 148 ident: b0065 article-title: Hybrid methods for lot sizing on parallel machines publication-title: Comput. Oper. Res. – volume: 19 start-page: 946 year: 1971 end-page: 969 ident: b0110 article-title: An efficient algorithm for multi-item scheduling publication-title: Oper. Res. – volume: 29 start-page: 523 year: 2017 end-page: 543 ident: b0210 article-title: Progressive selection method for the coupled lot-sizing and cutting-stock problem publication-title: INFORMS J. Comput. – volume: 29 start-page: 1126 year: 1983 end-page: 1141 ident: b0025 article-title: Mathematical programming approaches to capacity-constrained MRP systems: review, formulation and problem reduction publication-title: Manage. Sci. – volume: 25 start-page: 299 year: 2010 end-page: 319 ident: b0135 article-title: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem publication-title: Optim. Methods Software – volume: 59 start-page: 1477 year: 2011 end-page: 1490 ident: b0030 article-title: Benders decomposition for large-scale uncapacitated hub location publication-title: Oper. Res. – volume: 53 start-page: 48 year: 2005 end-page: 60 ident: b0180 article-title: Stochastic transportation-inventory network design problem publication-title: Oper. Res. – volume: 21 start-page: 1 year: 2019 end-page: 20 ident: b0235 article-title: Integrated optimization of location, inventory and routing in supply chain network design publication-title: Transp. Res. Part B: Methodol. – volume: 179 start-page: 1109 year: 2007 end-page: 1125 ident: b0105 article-title: A branch-and-price algorithm for the capacitated facility location problem publication-title: Eur. J. Oper. Res. – volume: 55 start-page: 78 year: 2010 end-page: 89 ident: b0160 article-title: Integrating facility location and production planning decisions publication-title: Networks – volume: 27 start-page: 431 year: 2015 end-page: 448 ident: b0010 article-title: Period decompositions for the capacitated lot sizing problem with setup times publication-title: INFORMS J. Comput. – volume: 30 start-page: 389 year: 2005 end-page: 403 ident: b0230 article-title: A multiexchange local search algorithm for the capacitated facility location problem publication-title: Math. Oper. Res. – volume: 86 start-page: 154 year: 2019 end-page: 172 ident: b0125 article-title: Solving a large multi-product production-routing problem with delivery time windows publication-title: Omega – volume: 5 start-page: 229 year: 1985 end-page: 235 ident: b0060 article-title: An efficient implementation of the Wagner–Whitin algorithm for dynamic lot-sizing publication-title: J. Oper. Manage. – volume: 30 start-page: 236 year: 2018 end-page: 258 ident: b0215 article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines publication-title: INFORMS J. Comput. – volume: 1 start-page: 3 year: 2011 end-page: 18 ident: b0040 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. – volume: 18 start-page: 767 year: 1993 end-page: 785 ident: b0150 article-title: Lot-sizing with constant batches: formulation and valid inequalities publication-title: Math. Oper. Res. – volume: 277 start-page: 521 year: 2019 end-page: 541 ident: b0200 article-title: Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials publication-title: Eur. J. Oper. Res. – volume: 30 start-page: 291 year: 1996 end-page: 302 ident: b0140 article-title: Production, transportation, and distribution planning in a multi-commodity tri-echelon system publication-title: Transp. Sci. – year: 2006 ident: b0145 publication-title: Production Planning by Mixed Integer Programming – volume: 55 start-page: 909 year: 2007 end-page: 920 ident: b0035 article-title: A new Dantzig–Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times publication-title: Oper. Res. – volume: 4 start-page: 115 year: 1958 end-page: 135 ident: b0120 article-title: Programming of economic lot sizes publication-title: Manage. Sci. – volume: 5 start-page: 89 year: 1958 end-page: 96 ident: b0195 article-title: Dynamic version of the economic lot size model publication-title: Manage. Sci. – volume: 28 start-page: 766 year: 2016 end-page: 780 ident: b0005 article-title: Local cuts and two-period convex hull closures for big-bucket lot-sizing problems publication-title: INFORMS J. Comput. – volume: 7 start-page: 500 year: 2010 end-page: 511 ident: b0220 article-title: An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times publication-title: IEEE Trans. Autom. Sci. Eng. – volume: 59 start-page: 1477 issue: 6 year: 2011 ident: 10.1016/j.cor.2020.105068_b0030 article-title: Benders decomposition for large-scale uncapacitated hub location publication-title: Oper. Res. doi: 10.1287/opre.1110.0965 – volume: 34 start-page: 296 issue: 3 year: 2006 ident: 10.1016/j.cor.2020.105068_b0190 article-title: A generic view of Dantzig-Wolfe decomposition in mixed integer programming publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2005.05.009 – volume: 5 start-page: 89 issue: 1 year: 1958 ident: 10.1016/j.cor.2020.105068_b0195 article-title: Dynamic version of the economic lot size model publication-title: Manage. Sci. doi: 10.1287/mnsc.5.1.89 – volume: 8 start-page: 217 issue: 3 year: 1974 ident: 10.1016/j.cor.2020.105068_b0080 article-title: An algorithm for the M-median plant location problem publication-title: Transp. Sci. doi: 10.1287/trsc.8.3.217 – volume: 30 start-page: 389 issue: 2 year: 2005 ident: 10.1016/j.cor.2020.105068_b0230 article-title: A multiexchange local search algorithm for the capacitated facility location problem publication-title: Math. Oper. Res. doi: 10.1287/moor.1040.0125 – volume: 277 start-page: 521 issue: 2 year: 2019 ident: 10.1016/j.cor.2020.105068_b0200 article-title: Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.03.001 – volume: 83 start-page: 101 issue: 1 year: 1998 ident: 10.1016/j.cor.2020.105068_b0015 article-title: Plant location with minimum inventory publication-title: Math. Program. doi: 10.1007/BF02680552 – volume: 37 start-page: 40 issue: 1 year: 2003 ident: 10.1016/j.cor.2020.105068_b0175 article-title: A joint location-inventory model publication-title: Transp. Sci. doi: 10.1287/trsc.37.1.40.12823 – volume: 28 start-page: 766 issue: 4 year: 2016 ident: 10.1016/j.cor.2020.105068_b0005 article-title: Local cuts and two-period convex hull closures for big-bucket lot-sizing problems publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2016.0712 – volume: 26 start-page: 591 issue: 3 year: 2001 ident: 10.1016/j.cor.2020.105068_b0130 article-title: On the Wagner-Whitin lot-sizing polyhedron publication-title: Math. Oper. Res. doi: 10.1287/moor.26.3.591.10586 – volume: 53 start-page: 48 issue: 1 year: 2005 ident: 10.1016/j.cor.2020.105068_b0180 article-title: Stochastic transportation-inventory network design problem publication-title: Oper. Res. doi: 10.1287/opre.1040.0140 – volume: 86 start-page: 154 year: 2019 ident: 10.1016/j.cor.2020.105068_b0125 article-title: Solving a large multi-product production-routing problem with delivery time windows publication-title: Omega doi: 10.1016/j.omega.2018.07.006 – volume: 25 start-page: 299 issue: 2 year: 2010 ident: 10.1016/j.cor.2020.105068_b0135 article-title: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem publication-title: Optim. Methods Software doi: 10.1080/10556780902992837 – volume: 2 start-page: 82 year: 1974 ident: 10.1016/j.cor.2020.105068_b0085 article-title: Lagrangean relaxation for integer programming publication-title: Math. Program. Study doi: 10.1007/BFb0120690 – volume: 18 start-page: 767 issue: 4 year: 1993 ident: 10.1016/j.cor.2020.105068_b0150 article-title: Lot-sizing with constant batches: formulation and valid inequalities publication-title: Math. Oper. Res. doi: 10.1287/moor.18.4.767 – volume: 21 start-page: 1 year: 2019 ident: 10.1016/j.cor.2020.105068_b0235 article-title: Integrated optimization of location, inventory and routing in supply chain network design publication-title: Transp. Res. Part B: Methodol. doi: 10.1016/j.trb.2019.01.003 – volume: 29 start-page: 1126 issue: 10 year: 1983 ident: 10.1016/j.cor.2020.105068_b0025 article-title: Mathematical programming approaches to capacity-constrained MRP systems: review, formulation and problem reduction publication-title: Manage. Sci. doi: 10.1287/mnsc.29.10.1126 – volume: 29 start-page: 523 issue: 3 year: 2017 ident: 10.1016/j.cor.2020.105068_b0210 article-title: Progressive selection method for the coupled lot-sizing and cutting-stock problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2017.0746 – volume: 51 start-page: 922 issue: 6 year: 2003 ident: 10.1016/j.cor.2020.105068_b0075 article-title: A branch-and-price algorithm for the multiperiod single-sourcing problem publication-title: Oper. Res. doi: 10.1287/opre.51.6.922.24914 – volume: 51 start-page: 1689 issue: 11 year: 2003 ident: 10.1016/j.cor.2020.105068_b0100 article-title: Lower bounds for the capacitated facility location problem based on column generation publication-title: Manage. Sci. doi: 10.1287/mnsc.1050.0410 – year: 2006 ident: 10.1016/j.cor.2020.105068_b0145 – volume: 58 start-page: 419 issue: 5 year: 2011 ident: 10.1016/j.cor.2020.105068_b0170 article-title: Exact algorithms for integrated facility location and production planning problems publication-title: Naval Res. Logist. doi: 10.1002/nav.20458 – volume: 112 start-page: 301 issue: 1–3 year: 2001 ident: 10.1016/j.cor.2020.105068_b0155 article-title: A probabilistic analysis of the multi-period single-sourcing problem publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00320-6 – volume: 27 start-page: 431 issue: 3 year: 2015 ident: 10.1016/j.cor.2020.105068_b0010 article-title: Period decompositions for the capacitated lot sizing problem with setup times publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2014.0636 – volume: 28 start-page: 709 issue: 4 year: 1995 ident: 10.1016/j.cor.2020.105068_b0090 article-title: Computationally efficient solution of the multi-item, capacitated lot-sizing problem publication-title: Comput. Ind. Eng. doi: 10.1016/0360-8352(95)00021-R – volume: 34 start-page: 145 issue: 1 year: 1986 ident: 10.1016/j.cor.2020.105068_b0165 article-title: A cross decomposition algorithm for capacitated facility location publication-title: Oper. Res. doi: 10.1287/opre.34.1.145 – year: 1998 ident: 10.1016/j.cor.2020.105068_b0205 article-title: Integer Programming. volume ISBN 0-471-28366-5 of Wiley-Interscience series in discrete mathematics and optimization publication-title: Wiley – volume: 30 start-page: 236 issue: 2 year: 2018 ident: 10.1016/j.cor.2020.105068_b0215 article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2017.0777 – volume: 11 start-page: 874 issue: 9 year: 1965 ident: 10.1016/j.cor.2020.105068_b0050 article-title: Optimal programming of lot sizes, inventory and labor allocations publication-title: Manage. Sci. doi: 10.1287/mnsc.11.9.874 – volume: 30 start-page: 291 issue: 4 year: 1996 ident: 10.1016/j.cor.2020.105068_b0140 article-title: Production, transportation, and distribution planning in a multi-commodity tri-echelon system publication-title: Transp. Sci. doi: 10.1287/trsc.30.4.291 – volume: vol. 41 year: 2005 ident: 10.1016/j.cor.2020.105068_b0045 – volume: 1 start-page: 3 year: 2011 ident: 10.1016/j.cor.2020.105068_b0040 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.02.002 – volume: 179 start-page: 1109 issue: 3 year: 2007 ident: 10.1016/j.cor.2020.105068_b0105 article-title: A branch-and-price algorithm for the capacitated facility location problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.03.078 – volume: 35 start-page: 832 issue: 6 year: 1987 ident: 10.1016/j.cor.2020.105068_b0055 article-title: Solving multi-item lot-sizing problems using variable redefinition publication-title: Oper. Res. doi: 10.1287/opre.35.6.832 – volume: 4 start-page: 115 issue: 2 year: 1958 ident: 10.1016/j.cor.2020.105068_b0120 article-title: Programming of economic lot sizes publication-title: Manage. Sci. doi: 10.1287/mnsc.4.2.115 – volume: 7 start-page: 500 issue: 3 year: 2010 ident: 10.1016/j.cor.2020.105068_b0220 article-title: An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2009.2039134 – volume: 35 start-page: 353 issue: 3 year: 1989 ident: 10.1016/j.cor.2020.105068_b0185 article-title: Capacitated lot sizing with setup times publication-title: Manage. Sci. doi: 10.1287/mnsc.35.3.353 – volume: 46 start-page: 316 issue: 3 year: 1998 ident: 10.1016/j.cor.2020.105068_b0020 article-title: Branch-and-price: column generation for solving huge integer programs publication-title: Oper. Res. doi: 10.1287/opre.46.3.316 – volume: 63 start-page: 136 issue: 2 year: 2015 ident: 10.1016/j.cor.2020.105068_b0065 article-title: Hybrid methods for lot sizing on parallel machines publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.04.015 – volume: 28 start-page: 465 issue: 3 year: 2016 ident: 10.1016/j.cor.2020.105068_b0070 article-title: A horizon decomposition approach for the capacitated lot-sizing problem with setup times publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2016.0691 – ident: 10.1016/j.cor.2020.105068_b0115 doi: 10.1016/j.ijpe.2015.08.024 – volume: 32 start-page: 185 issue: 2 year: 2004 ident: 10.1016/j.cor.2020.105068_b0095 article-title: Improved lower bounds for the capacitated lot sizing problem with setup times publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.06.001 – volume: 55 start-page: 78 issue: 2 year: 2010 ident: 10.1016/j.cor.2020.105068_b0160 article-title: Integrating facility location and production planning decisions publication-title: Networks doi: 10.1002/net.20315 – volume: 5 start-page: 229 issue: 2 year: 1985 ident: 10.1016/j.cor.2020.105068_b0060 article-title: An efficient implementation of the Wagner–Whitin algorithm for dynamic lot-sizing publication-title: J. Oper. Manage. doi: 10.1016/0272-6963(85)90009-9 – volume: 19 start-page: 946 issue: 4 year: 1971 ident: 10.1016/j.cor.2020.105068_b0110 article-title: An efficient algorithm for multi-item scheduling publication-title: Oper. Res. doi: 10.1287/opre.19.4.946 – volume: 98 start-page: 149 year: 2018 ident: 10.1016/j.cor.2020.105068_b0225 article-title: The green capacitated multi-item lot sizing problem with parallel machines publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.05.024 – volume: 55 start-page: 909 issue: 5 year: 2007 ident: 10.1016/j.cor.2020.105068_b0035 article-title: A new Dantzig–Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times publication-title: Oper. Res. doi: 10.1287/opre.1070.0404
SSID	ssj0000721
Score	2.4111826
Snippet	•We propose two mathematical models for the facility location and production planning problem.•Item Dantzig-Wolfe decomposition is proposed to improve lower... There are several mathematical models proposed for the facility location and production planning problem in the literature. However, some of these models...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	105068
SubjectTerms	Benchmarks Column generation Customers Dantzig-Wolfe decomposition Decomposition Facility location Item decomposition Linear programming Lot-sizing Lower bounds Mathematical models Mixed integer programming Operations research Production distribution Production planning
Title	Dantzig-Wolfe decomposition for the facility location and production planning problem
URI	https://dx.doi.org/10.1016/j.cor.2020.105068 https://www.proquest.com/docview/2505721918
Volume	124
WOSCitedRecordID	wos000571468600007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: ScienceDirect Freedom Collection 2021 customDbUrl: eissn: 0305-0548 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLagQwgO_CigDQbygRNTpMRx6vg4oSHgMCGxadUukePaa6YpiZoUTfvreXZspytiAiQuUWs1TuXvs_388r33EHoviKBgpcaRpJxEdJGlEZdGmVMKnkgJBkmysMUm2PFxPp_zby49QWfLCbC6zq-veftfoYY2ANuEzv4F3KFTaIDPADpcAXa4_hHwgGN_U11EZ82VNkFRRjTulFlBU6iFrKz9bbay3iuS2yH7q_naulpGB67gzKYN6wtBdJY2TatWTk7nEgcFB_PZ2rJBNMGNYysIH5wvm_qiW65HNVDlvNbny8Cz4MmeV8K6jDf9E2Rb6xECZ0aVkg3WMprBbEiyGRbiIZr6l0V98C9cAiYmgSuxtYnjoRjPVq7s76Zf0y0xJ708o_fRDmEZzydo5_DL0fzruEkzG5IX_od_4W2lf1sP-p3JsrV5W4vk5Bl64o4S-HCgwHN0T9VT9NBHMkzRUw8Udgv4FD3eSD_5Ap3eogq-RRUMVMFAFeypgj1VMFAFj1TBnirYUeUlOv10dPLxc-TKbEQyzVgfCcnKnFAZKyYUmYmSMz7TJacLrTIhFpqRMlEKDp5al6qkOVd8JrOUplpoIfL0FZrUTa12EY5hdsMmIDXNSqpEXlLGEkEkmWnCM8H3UOxHspAuB70phXJVeLHhZQGDX5jBL4bB30Mfwi3tkIDlrh9TD0_hLMjBMiyAS3fdtu-hLNxM7gpzNgCS8CR__W-9vkGPxvmwjyb9aq3eogfyR191q3eOkD8B-L2h1Q
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Dantzig-Wolfe+decomposition+for+the+facility+location+and+production+planning+problem&rft.jtitle=Computers+%26+operations+research&rft.au=Wu%2C+Tao&rft.au=Shi%2C+Zhongshun&rft.au=Liang%2C+Zhe&rft.au=Zhang%2C+Xiaoning&rft.date=2020-12-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.volume=124&rft_id=info:doi/10.1016%2Fj.cor.2020.105068&rft.externalDocID=S0305054820301854
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon