An LP-based heuristic for two-stage capacitated facility location problems
In this paper, a linear programming based heuristic is considered for a two-stage capacitated facility location problem with single source constraints. The problem is to find the optimal locations of depots from a set of possible depot sites in order to serve customers with a given demand, the optim...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society 1999-02, Vol.50 (2), p.157-166 |
|---|---|
| 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 | 166 |
|---|---|
| container_issue | 2 |
| container_start_page | 157 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 50 |
| creator | Klose, A |
| description | In this paper, a linear programming based heuristic is considered for a two-stage capacitated facility location problem with single source constraints. The problem is to find the optimal locations of depots from a set of possible depot sites in order to serve customers with a given demand, the optimal assignments of customers to depots and the optimal product flow from plants to depots. Good lower and upper bounds can be obtained for this problem in short computation times by adopting a linear programming approach. To this end, the LP formulation is iteratively refined using valid inequalities and facets which have been described in the literature for various relaxations of the problem. After each reoptimisation step, that is the recalculation of the LP solution after the addition of valid inequalities, feasible solutions are obtained from the current LP solution by applying simple heuristics. The results of extensive computational experiments are given. |
| doi_str_mv | 10.1057/palgrave.jors.2600675 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_26963083</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>3010564</jstor_id><sourcerecordid>3010564</sourcerecordid><originalsourceid>FETCH-LOGICAL-c471t-64051bbd6670f72b095419972095943b288945fa87e06a86ff4cb34fcced0a1b3</originalsourceid><addsrcrecordid>eNqNkUFrGzEQhUVJoE7Sn1BYSult3dFKK61uCaFJWwztoT2LWVlyZeSVK8kJ_veVsUNCD6UnDeh7b56eCHlLYU6hlx-3GFYJH-x8HVOedwJAyP4VmVEuRauYgDMyAyqg7cXQvSYXOa8BQAFVM_L1ZmoW39sRs102v-wu-Vy8aVxMTXmMbS64so3BLRpfsFTG1Sn4sm9CNFh8nJptimOwm3xFzh2GbN-czkvy8-7Tj9vP7eLb_Zfbm0VruKSlFRx6Oo5LISQ42Y2gek6Vkl0dFGdjNwyK9w4HaUHgIJzjZmTcGWOXgHRkl-TD0bcu_r2zueiNz8aGgJONu6w7oQSDgVXw3V_gOu7SVLPpjlHGORWiQv0RMinmnKzT2-Q3mPaagj7Uq5_q1Yd69aneqnt_MsdsMLiEk_H5WVzfA8MBE0cs15tpZdNzhv_0X-cS08tQHQOpGVSt4BW7PmJ-qn-2wceYwlIX3IeYnjKxf2_6A6imsoA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>231344166</pqid></control><display><type>article</type><title>An LP-based heuristic for two-stage capacitated facility location problems</title><source>Jstor Complete Legacy</source><creator>Klose, A</creator><creatorcontrib>Klose, A</creatorcontrib><description>In this paper, a linear programming based heuristic is considered for a two-stage capacitated facility location problem with single source constraints. The problem is to find the optimal locations of depots from a set of possible depot sites in order to serve customers with a given demand, the optimal assignments of customers to depots and the optimal product flow from plants to depots. Good lower and upper bounds can be obtained for this problem in short computation times by adopting a linear programming approach. To this end, the LP formulation is iteratively refined using valid inequalities and facets which have been described in the literature for various relaxations of the problem. After each reoptimisation step, that is the recalculation of the LP solution after the addition of valid inequalities, feasible solutions are obtained from the current LP solution by applying simple heuristics. The results of extensive computational experiments are given.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/palgrave.jors.2600675</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Algorithms ; Applied sciences ; Business and Management ; Cost allocation ; cutting planes ; Exact sciences and technology ; facility location ; Fixed costs ; Flows in networks. Combinatorial problems ; Heuristic ; Heuristics ; Industrial plant locations ; Integers ; Lagrangian function ; Linear programming ; Location analysis ; LP-based heuristics ; Management ; Mathematical inequalities ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Site selection ; Studies ; Theoretical Paper ; Theoretical Papers ; Variable costs</subject><ispartof>The Journal of the Operational Research Society, 1999-02, Vol.50 (2), p.157-166</ispartof><rights>Copyright © 1999, Operational Research Society 1999</rights><rights>Copyright 1999 Operational Research Society Ltd</rights><rights>Operational Research Society 1999</rights><rights>1999 INIST-CNRS</rights><rights>Copyright (c) 1999 Operational Research Society</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c471t-64051bbd6670f72b095419972095943b288945fa87e06a86ff4cb34fcced0a1b3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/3010564$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/3010564$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,776,780,799,27901,27902,57992,58225</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1720085$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Klose, A</creatorcontrib><title>An LP-based heuristic for two-stage capacitated facility location problems</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>In this paper, a linear programming based heuristic is considered for a two-stage capacitated facility location problem with single source constraints. The problem is to find the optimal locations of depots from a set of possible depot sites in order to serve customers with a given demand, the optimal assignments of customers to depots and the optimal product flow from plants to depots. Good lower and upper bounds can be obtained for this problem in short computation times by adopting a linear programming approach. To this end, the LP formulation is iteratively refined using valid inequalities and facets which have been described in the literature for various relaxations of the problem. After each reoptimisation step, that is the recalculation of the LP solution after the addition of valid inequalities, feasible solutions are obtained from the current LP solution by applying simple heuristics. The results of extensive computational experiments are given.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Business and Management</subject><subject>Cost allocation</subject><subject>cutting planes</subject><subject>Exact sciences and technology</subject><subject>facility location</subject><subject>Fixed costs</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Industrial plant locations</subject><subject>Integers</subject><subject>Lagrangian function</subject><subject>Linear programming</subject><subject>Location analysis</subject><subject>LP-based heuristics</subject><subject>Management</subject><subject>Mathematical inequalities</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Site selection</subject><subject>Studies</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><subject>Variable costs</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqNkUFrGzEQhUVJoE7Sn1BYSult3dFKK61uCaFJWwztoT2LWVlyZeSVK8kJ_veVsUNCD6UnDeh7b56eCHlLYU6hlx-3GFYJH-x8HVOedwJAyP4VmVEuRauYgDMyAyqg7cXQvSYXOa8BQAFVM_L1ZmoW39sRs102v-wu-Vy8aVxMTXmMbS64so3BLRpfsFTG1Sn4sm9CNFh8nJptimOwm3xFzh2GbN-czkvy8-7Tj9vP7eLb_Zfbm0VruKSlFRx6Oo5LISQ42Y2gek6Vkl0dFGdjNwyK9w4HaUHgIJzjZmTcGWOXgHRkl-TD0bcu_r2zueiNz8aGgJONu6w7oQSDgVXw3V_gOu7SVLPpjlHGORWiQv0RMinmnKzT2-Q3mPaagj7Uq5_q1Yd69aneqnt_MsdsMLiEk_H5WVzfA8MBE0cs15tpZdNzhv_0X-cS08tQHQOpGVSt4BW7PmJ-qn-2wceYwlIX3IeYnjKxf2_6A6imsoA</recordid><startdate>19990201</startdate><enddate>19990201</enddate><creator>Klose, A</creator><general>Taylor & Francis</general><general>Macmillan Press</general><general>Palgrave Macmillan UK</general><general>Palgrave</general><general>Taylor & Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19990201</creationdate><title>An LP-based heuristic for two-stage capacitated facility location problems</title><author>Klose, A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c471t-64051bbd6670f72b095419972095943b288945fa87e06a86ff4cb34fcced0a1b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Business and Management</topic><topic>Cost allocation</topic><topic>cutting planes</topic><topic>Exact sciences and technology</topic><topic>facility location</topic><topic>Fixed costs</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Industrial plant locations</topic><topic>Integers</topic><topic>Lagrangian function</topic><topic>Linear programming</topic><topic>Location analysis</topic><topic>LP-based heuristics</topic><topic>Management</topic><topic>Mathematical inequalities</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Site selection</topic><topic>Studies</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><topic>Variable costs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Klose, A</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Career & Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</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>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Klose, A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An LP-based heuristic for two-stage capacitated facility location problems</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>1999-02-01</date><risdate>1999</risdate><volume>50</volume><issue>2</issue><spage>157</spage><epage>166</epage><pages>157-166</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>In this paper, a linear programming based heuristic is considered for a two-stage capacitated facility location problem with single source constraints. The problem is to find the optimal locations of depots from a set of possible depot sites in order to serve customers with a given demand, the optimal assignments of customers to depots and the optimal product flow from plants to depots. Good lower and upper bounds can be obtained for this problem in short computation times by adopting a linear programming approach. To this end, the LP formulation is iteratively refined using valid inequalities and facets which have been described in the literature for various relaxations of the problem. After each reoptimisation step, that is the recalculation of the LP solution after the addition of valid inequalities, feasible solutions are obtained from the current LP solution by applying simple heuristics. The results of extensive computational experiments are given.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/palgrave.jors.2600675</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 1999-02, Vol.50 (2), p.157-166 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_26963083 |
| source | Jstor Complete Legacy |
| subjects | Algorithms Applied sciences Business and Management Cost allocation cutting planes Exact sciences and technology facility location Fixed costs Flows in networks. Combinatorial problems Heuristic Heuristics Industrial plant locations Integers Lagrangian function Linear programming Location analysis LP-based heuristics Management Mathematical inequalities Operational research and scientific management Operational research. Management science Operations research Operations Research/Decision Theory Site selection Studies Theoretical Paper Theoretical Papers Variable costs |
| title | An LP-based heuristic for two-stage capacitated facility location problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T10%3A35%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20LP-based%20heuristic%20for%20two-stage%20capacitated%20facility%20location%20problems&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Klose,%20A&rft.date=1999-02-01&rft.volume=50&rft.issue=2&rft.spage=157&rft.epage=166&rft.pages=157-166&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/palgrave.jors.2600675&rft_dat=%3Cjstor_proqu%3E3010564%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=231344166&rft_id=info:pmid/&rft_jstor_id=3010564&rfr_iscdi=true |