A Benders Decomposition Method for Dynamic Facility Location in Integrated Closed Chain Problem
The design for integrating the forward-reverse logistics network has attracted growing attention with the relentless pressures from environmental and social requirements to increase operational efficiency and support sustainable operations. Therefore, a dynamic facility in the closed chain is presen...
Gespeichert in:
| Veröffentlicht in: | Mathematical problems in engineering 2021, Vol.2021, p.1-14 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 14 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | Mathematical problems in engineering |
| container_volume | 2021 |
| creator | Rahmani, Arsalan Yousefikhoshbakht, Majid |
| description | The design for integrating the forward-reverse logistics network has attracted growing attention with the relentless pressures from environmental and social requirements to increase operational efficiency and support sustainable operations. Therefore, a dynamic facility in the closed chain is presented for the first time. In this problem, a set of facilities with determined locations are used based on whether they serve as forward-reverse, or joint facilities dealing with products from both directions. The objective is to minimize the total costs, including fixed location, fixed ordering, inventory holding, transportation, and reprocessing costs. In this paper, a mixed integer nonlinear program (MINLP) of a single type of forwarding product and a single type of returned product is proposed and a Benders decomposition method (BDM) is developed to solve the problem efficiently. The computational results on several randomly generated issues demonstrate that the proposed algorithm can efficiently solve the MINLP model compared to other algorithms. |
| doi_str_mv | 10.1155/2021/6684029 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2494041599</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2494041599</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-75e84309aa0fd24d9be68cb8c03223181883e429dcd8a3b5eb497ac1762502af3</originalsourceid><addsrcrecordid>eNp90E9LwzAYBvAgCs7pzQ8Q8Kh1-dsmx7k5HVT0oOAtpEnqMtpmJh2yb2_ndvb0vLz8eF94ALjG6B5jzicEETzJc8EQkSdghHlOM45ZcTrMiLAME_p5Di5SWqNBcixGQE3hg-usiwnOnQntJiTf-9DBF9evgoV1iHC-63TrDVxo4xvf72AZjP5DvoPLrndfUffOwlkT0j5Weti_xVA1rr0EZ7Vukrs65hh8LB7fZ89Z-fq0nE3LzFDB-6zgTjCKpNaotoRZWblcmEoYRAmhWGAhqGNEWmOFphV3FZOFNrjICUdE13QMbg53NzF8b13q1TpsYze8VIRJhhjmUg7q7qBMDClFV6tN9K2OO4WR2leo9hWqY4UDvz3wle-s_vH_61-Td2-s</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2494041599</pqid></control><display><type>article</type><title>A Benders Decomposition Method for Dynamic Facility Location in Integrated Closed Chain Problem</title><source>Wiley Online Library Open Access</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Rahmani, Arsalan ; Yousefikhoshbakht, Majid</creator><contributor>Zhang, Xiaofei ; Xiaofei Zhang</contributor><creatorcontrib>Rahmani, Arsalan ; Yousefikhoshbakht, Majid ; Zhang, Xiaofei ; Xiaofei Zhang</creatorcontrib><description>The design for integrating the forward-reverse logistics network has attracted growing attention with the relentless pressures from environmental and social requirements to increase operational efficiency and support sustainable operations. Therefore, a dynamic facility in the closed chain is presented for the first time. In this problem, a set of facilities with determined locations are used based on whether they serve as forward-reverse, or joint facilities dealing with products from both directions. The objective is to minimize the total costs, including fixed location, fixed ordering, inventory holding, transportation, and reprocessing costs. In this paper, a mixed integer nonlinear program (MINLP) of a single type of forwarding product and a single type of returned product is proposed and a Benders decomposition method (BDM) is developed to solve the problem efficiently. The computational results on several randomly generated issues demonstrate that the proposed algorithm can efficiently solve the MINLP model compared to other algorithms.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><identifier>DOI: 10.1155/2021/6684029</identifier><language>eng</language><publisher>New York: Hindawi</publisher><subject>Algorithms ; Benders decomposition ; Costs ; Customers ; Decomposition ; Engineering ; Heuristic ; Mixed integer ; Product development ; Reprocessing ; Reverse logistics ; Supply chains</subject><ispartof>Mathematical problems in engineering, 2021, Vol.2021, p.1-14</ispartof><rights>Copyright © 2021 Arsalan Rahmani and Majid Yousefikhoshbakht.</rights><rights>Copyright © 2021 Arsalan Rahmani and Majid Yousefikhoshbakht. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-75e84309aa0fd24d9be68cb8c03223181883e429dcd8a3b5eb497ac1762502af3</citedby><cites>FETCH-LOGICAL-c385t-75e84309aa0fd24d9be68cb8c03223181883e429dcd8a3b5eb497ac1762502af3</cites><orcidid>0000-0003-1965-1594</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><contributor>Zhang, Xiaofei</contributor><contributor>Xiaofei Zhang</contributor><creatorcontrib>Rahmani, Arsalan</creatorcontrib><creatorcontrib>Yousefikhoshbakht, Majid</creatorcontrib><title>A Benders Decomposition Method for Dynamic Facility Location in Integrated Closed Chain Problem</title><title>Mathematical problems in engineering</title><description>The design for integrating the forward-reverse logistics network has attracted growing attention with the relentless pressures from environmental and social requirements to increase operational efficiency and support sustainable operations. Therefore, a dynamic facility in the closed chain is presented for the first time. In this problem, a set of facilities with determined locations are used based on whether they serve as forward-reverse, or joint facilities dealing with products from both directions. The objective is to minimize the total costs, including fixed location, fixed ordering, inventory holding, transportation, and reprocessing costs. In this paper, a mixed integer nonlinear program (MINLP) of a single type of forwarding product and a single type of returned product is proposed and a Benders decomposition method (BDM) is developed to solve the problem efficiently. The computational results on several randomly generated issues demonstrate that the proposed algorithm can efficiently solve the MINLP model compared to other algorithms.</description><subject>Algorithms</subject><subject>Benders decomposition</subject><subject>Costs</subject><subject>Customers</subject><subject>Decomposition</subject><subject>Engineering</subject><subject>Heuristic</subject><subject>Mixed integer</subject><subject>Product development</subject><subject>Reprocessing</subject><subject>Reverse logistics</subject><subject>Supply chains</subject><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp90E9LwzAYBvAgCs7pzQ8Q8Kh1-dsmx7k5HVT0oOAtpEnqMtpmJh2yb2_ndvb0vLz8eF94ALjG6B5jzicEETzJc8EQkSdghHlOM45ZcTrMiLAME_p5Di5SWqNBcixGQE3hg-usiwnOnQntJiTf-9DBF9evgoV1iHC-63TrDVxo4xvf72AZjP5DvoPLrndfUffOwlkT0j5Weti_xVA1rr0EZ7Vukrs65hh8LB7fZ89Z-fq0nE3LzFDB-6zgTjCKpNaotoRZWblcmEoYRAmhWGAhqGNEWmOFphV3FZOFNrjICUdE13QMbg53NzF8b13q1TpsYze8VIRJhhjmUg7q7qBMDClFV6tN9K2OO4WR2leo9hWqY4UDvz3wle-s_vH_61-Td2-s</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Rahmani, Arsalan</creator><creator>Yousefikhoshbakht, Majid</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0003-1965-1594</orcidid></search><sort><creationdate>2021</creationdate><title>A Benders Decomposition Method for Dynamic Facility Location in Integrated Closed Chain Problem</title><author>Rahmani, Arsalan ; Yousefikhoshbakht, Majid</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-75e84309aa0fd24d9be68cb8c03223181883e429dcd8a3b5eb497ac1762502af3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Benders decomposition</topic><topic>Costs</topic><topic>Customers</topic><topic>Decomposition</topic><topic>Engineering</topic><topic>Heuristic</topic><topic>Mixed integer</topic><topic>Product development</topic><topic>Reprocessing</topic><topic>Reverse logistics</topic><topic>Supply chains</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rahmani, Arsalan</creatorcontrib><creatorcontrib>Yousefikhoshbakht, Majid</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Middle East & Africa Database</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rahmani, Arsalan</au><au>Yousefikhoshbakht, Majid</au><au>Zhang, Xiaofei</au><au>Xiaofei Zhang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Benders Decomposition Method for Dynamic Facility Location in Integrated Closed Chain Problem</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2021</date><risdate>2021</risdate><volume>2021</volume><spage>1</spage><epage>14</epage><pages>1-14</pages><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>The design for integrating the forward-reverse logistics network has attracted growing attention with the relentless pressures from environmental and social requirements to increase operational efficiency and support sustainable operations. Therefore, a dynamic facility in the closed chain is presented for the first time. In this problem, a set of facilities with determined locations are used based on whether they serve as forward-reverse, or joint facilities dealing with products from both directions. The objective is to minimize the total costs, including fixed location, fixed ordering, inventory holding, transportation, and reprocessing costs. In this paper, a mixed integer nonlinear program (MINLP) of a single type of forwarding product and a single type of returned product is proposed and a Benders decomposition method (BDM) is developed to solve the problem efficiently. The computational results on several randomly generated issues demonstrate that the proposed algorithm can efficiently solve the MINLP model compared to other algorithms.</abstract><cop>New York</cop><pub>Hindawi</pub><doi>10.1155/2021/6684029</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0003-1965-1594</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1024-123X |
| ispartof | Mathematical problems in engineering, 2021, Vol.2021, p.1-14 |
| issn | 1024-123X 1563-5147 |
| language | eng |
| recordid | cdi_proquest_journals_2494041599 |
| source | Wiley Online Library Open Access; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection |
| subjects | Algorithms Benders decomposition Costs Customers Decomposition Engineering Heuristic Mixed integer Product development Reprocessing Reverse logistics Supply chains |
| title | A Benders Decomposition Method for Dynamic Facility Location in Integrated Closed Chain Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T16%3A30%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Benders%20Decomposition%20Method%20for%20Dynamic%20Facility%20Location%20in%20Integrated%20Closed%20Chain%20Problem&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Rahmani,%20Arsalan&rft.date=2021&rft.volume=2021&rft.spage=1&rft.epage=14&rft.pages=1-14&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/10.1155/2021/6684029&rft_dat=%3Cproquest_cross%3E2494041599%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2494041599&rft_id=info:pmid/&rfr_iscdi=true |