An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions. Although a column generation algorithm was proposed recently in the literature, it remains a challenge to s...
Gespeichert in:
| Veröffentlicht in: | Transportation science 2010-05, Vol.44 (2), p.183-192 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 192 |
|---|---|
| container_issue | 2 |
| container_start_page | 183 |
| container_title | Transportation science |
| container_volume | 44 |
| creator | Shu, Jia |
| description | In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions. Although a column generation algorithm was proposed recently in the literature, it remains a challenge to solve large size instances of this NP-hard problem efficiently and effectively. The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%-4% on average. |
| doi_str_mv | 10.1287/trsc.1090.0302 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_gale_infotracmisc_A228076773</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A228076773</galeid><jstor_id>25769490</jstor_id><sourcerecordid>A228076773</sourcerecordid><originalsourceid>FETCH-LOGICAL-c561t-50f91842ab527d4ef7366d930b7835e30c2745d62361199189ed0d4311d9733c3</originalsourceid><addsrcrecordid>eNqFks1rFDEYxoMouK5evQmDIl6cNd-ZOS61tkKxIorHkM28s806k2yTDFL_ejNusSoLEkgO-T3vx8OD0FOCV4Q26k2Oya4IbvEKM0zvoQURVNaCc3UfLTDmpCZSiIfoUUo7jIlQRCzQx7WvTvveWQc-V2cRoLupzmGKLmVnqz7E6quJcBWmBPUnyMYNEKsPkL-H-K16C8ltfXW5z250P0x2wT9GD3ozJHhy-y7Rl3enn0_O64vLs_cn64vaCklyLXDfkoZTsxFUdRx6xaTsWoY3qmECGLZUcdFJyiQhbUFb6HDHGSFdqxizbIleHeruY7ieIGU9umRhGIyHMqxuyq6UN40o5PN_yF2Yoi_DacaVKN7JGXpxgLZmAO18H3I0di6p15Q2WElV2i5RfYTagodohuChL-78za-O8OV0MDp7VPD6D8FmSs5DKlex-SqnrZlSOlrfxpBShF7voxtNvNEE6zkUeg6FnkOh51AUwctbL0yyZuij8dal3ypKVavEL8-eHbhdyiHe_QslW97iOyPmneKY_tf3J_HXy8U</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>347512865</pqid></control><display><type>article</type><title>An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization</title><source>INFORMS PubsOnLine</source><source>EBSCO Business Source Complete</source><source>Jstor Complete Legacy</source><creator>Shu, Jia</creator><creatorcontrib>Shu, Jia</creatorcontrib><description>In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions. Although a column generation algorithm was proposed recently in the literature, it remains a challenge to solve large size instances of this NP-hard problem efficiently and effectively. The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%-4% on average.</description><identifier>ISSN: 0041-1655</identifier><identifier>EISSN: 1526-5447</identifier><identifier>DOI: 10.1287/trsc.1090.0302</identifier><identifier>CODEN: TRSCBJ</identifier><language>eng</language><publisher>Linthicum, MD: INFORMS</publisher><subject>Algorithms ; Applied sciences ; Carrying costs ; Design efficiency ; Design optimization ; Distribution ; distribution network design ; Evaluation ; Exact sciences and technology ; facility location ; Geography ; greedy algorithm ; Greedy algorithms ; Ground, air and sea transportation, marine construction ; Heuristics ; International business enterprises ; Inventories ; Inventory control ; Inventory management ; Logistics ; multiechelon inventory management ; Retail stores ; Retail trade ; Studies ; Supply chain management ; Technology application ; Transportation ; Transportation costs ; Transportation planning, management and economics ; Warehouses ; Warehousing</subject><ispartof>Transportation science, 2010-05, Vol.44 (2), p.183-192</ispartof><rights>Copyright © 2010 Institute for Operations Research and the Management Sciences</rights><rights>2015 INIST-CNRS</rights><rights>COPYRIGHT 2010 Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences May 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c561t-50f91842ab527d4ef7366d930b7835e30c2745d62361199189ed0d4311d9733c3</citedby><cites>FETCH-LOGICAL-c561t-50f91842ab527d4ef7366d930b7835e30c2745d62361199189ed0d4311d9733c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/25769490$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/trsc.1090.0302$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,799,3678,27903,27904,57996,58229,62593</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22797585$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shu, Jia</creatorcontrib><title>An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization</title><title>Transportation science</title><description>In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions. Although a column generation algorithm was proposed recently in the literature, it remains a challenge to solve large size instances of this NP-hard problem efficiently and effectively. The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%-4% on average.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Carrying costs</subject><subject>Design efficiency</subject><subject>Design optimization</subject><subject>Distribution</subject><subject>distribution network design</subject><subject>Evaluation</subject><subject>Exact sciences and technology</subject><subject>facility location</subject><subject>Geography</subject><subject>greedy algorithm</subject><subject>Greedy algorithms</subject><subject>Ground, air and sea transportation, marine construction</subject><subject>Heuristics</subject><subject>International business enterprises</subject><subject>Inventories</subject><subject>Inventory control</subject><subject>Inventory management</subject><subject>Logistics</subject><subject>multiechelon inventory management</subject><subject>Retail stores</subject><subject>Retail trade</subject><subject>Studies</subject><subject>Supply chain management</subject><subject>Technology application</subject><subject>Transportation</subject><subject>Transportation costs</subject><subject>Transportation planning, management and economics</subject><subject>Warehouses</subject><subject>Warehousing</subject><issn>0041-1655</issn><issn>1526-5447</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><recordid>eNqFks1rFDEYxoMouK5evQmDIl6cNd-ZOS61tkKxIorHkM28s806k2yTDFL_ejNusSoLEkgO-T3vx8OD0FOCV4Q26k2Oya4IbvEKM0zvoQURVNaCc3UfLTDmpCZSiIfoUUo7jIlQRCzQx7WvTvveWQc-V2cRoLupzmGKLmVnqz7E6quJcBWmBPUnyMYNEKsPkL-H-K16C8ltfXW5z250P0x2wT9GD3ozJHhy-y7Rl3enn0_O64vLs_cn64vaCklyLXDfkoZTsxFUdRx6xaTsWoY3qmECGLZUcdFJyiQhbUFb6HDHGSFdqxizbIleHeruY7ieIGU9umRhGIyHMqxuyq6UN40o5PN_yF2Yoi_DacaVKN7JGXpxgLZmAO18H3I0di6p15Q2WElV2i5RfYTagodohuChL-78za-O8OV0MDp7VPD6D8FmSs5DKlex-SqnrZlSOlrfxpBShF7voxtNvNEE6zkUeg6FnkOh51AUwctbL0yyZuij8dal3ypKVavEL8-eHbhdyiHe_QslW97iOyPmneKY_tf3J_HXy8U</recordid><startdate>20100501</startdate><enddate>20100501</enddate><creator>Shu, Jia</creator><general>INFORMS</general><general>Transportation Science & Logistic Society of the Institute for Operations Research and Management Sciences</general><general>Institute for Operations Research and the Management Sciences</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>XI7</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope></search><sort><creationdate>20100501</creationdate><title>An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization</title><author>Shu, Jia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c561t-50f91842ab527d4ef7366d930b7835e30c2745d62361199189ed0d4311d9733c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Carrying costs</topic><topic>Design efficiency</topic><topic>Design optimization</topic><topic>Distribution</topic><topic>distribution network design</topic><topic>Evaluation</topic><topic>Exact sciences and technology</topic><topic>facility location</topic><topic>Geography</topic><topic>greedy algorithm</topic><topic>Greedy algorithms</topic><topic>Ground, air and sea transportation, marine construction</topic><topic>Heuristics</topic><topic>International business enterprises</topic><topic>Inventories</topic><topic>Inventory control</topic><topic>Inventory management</topic><topic>Logistics</topic><topic>multiechelon inventory management</topic><topic>Retail stores</topic><topic>Retail trade</topic><topic>Studies</topic><topic>Supply chain management</topic><topic>Technology application</topic><topic>Transportation</topic><topic>Transportation costs</topic><topic>Transportation planning, management and economics</topic><topic>Warehouses</topic><topic>Warehousing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shu, Jia</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>Business Insights: Essentials</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><jtitle>Transportation science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shu, Jia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization</atitle><jtitle>Transportation science</jtitle><date>2010-05-01</date><risdate>2010</risdate><volume>44</volume><issue>2</issue><spage>183</spage><epage>192</epage><pages>183-192</pages><issn>0041-1655</issn><eissn>1526-5447</eissn><coden>TRSCBJ</coden><abstract>In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions. Although a column generation algorithm was proposed recently in the literature, it remains a challenge to solve large size instances of this NP-hard problem efficiently and effectively. The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%-4% on average.</abstract><cop>Linthicum, MD</cop><pub>INFORMS</pub><doi>10.1287/trsc.1090.0302</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0041-1655 |
| ispartof | Transportation science, 2010-05, Vol.44 (2), p.183-192 |
| issn | 0041-1655 1526-5447 |
| language | eng |
| recordid | cdi_gale_infotracmisc_A228076773 |
| source | INFORMS PubsOnLine; EBSCO Business Source Complete; Jstor Complete Legacy |
| subjects | Algorithms Applied sciences Carrying costs Design efficiency Design optimization Distribution distribution network design Evaluation Exact sciences and technology facility location Geography greedy algorithm Greedy algorithms Ground, air and sea transportation, marine construction Heuristics International business enterprises Inventories Inventory control Inventory management Logistics multiechelon inventory management Retail stores Retail trade Studies Supply chain management Technology application Transportation Transportation costs Transportation planning, management and economics Warehouses Warehousing |
| title | An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T22%3A58%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Efficient%20Greedy%20Heuristic%20for%20Warehouse-Retailer%20Network%20Design%20Optimization&rft.jtitle=Transportation%20science&rft.au=Shu,%20Jia&rft.date=2010-05-01&rft.volume=44&rft.issue=2&rft.spage=183&rft.epage=192&rft.pages=183-192&rft.issn=0041-1655&rft.eissn=1526-5447&rft.coden=TRSCBJ&rft_id=info:doi/10.1287/trsc.1090.0302&rft_dat=%3Cgale_proqu%3EA228076773%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=347512865&rft_id=info:pmid/&rft_galeid=A228076773&rft_jstor_id=25769490&rfr_iscdi=true |