Siting and Sizing of Facilities under Probabilistic Demands
In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance f...
Gespeichert in:
| Veröffentlicht in: | Journal of optimization theory and applications 2011-05, Vol.149 (2), p.420-440 |
|---|---|
| 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 | 440 |
|---|---|
| container_issue | 2 |
| container_start_page | 420 |
| container_title | Journal of optimization theory and applications |
| container_volume | 149 |
| creator | Fernandes, Luís M. Júdice, Joaquim J. Sherali, Hanif D. Antunes, António P. |
| description | In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that facilities must satisfy a threshold level of demand (facilities are not economically viable below that level). A Mixed-Integer Nonlinear Programming (MINLP) model is proposed for this problem. A branch-and-bound algorithm is designed for solving this MINLP and its convergence to a global minimum is established. A finite procedure is also introduced to find a feasible solution for the MINLP that reduces the overall search in the binary tree generated by the branch-and-bound algorithm. Some numerical results using a GAMS/MINOS implementation of the algorithm are reported to illustrate its efficacy and efficiency in practice. |
| doi_str_mv | 10.1007/s10957-010-9783-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_907955143</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>907955143</sourcerecordid><originalsourceid>FETCH-LOGICAL-c347t-433e207d8e29be2d886f81b7b344c316b3fe0ca7f5b71abebbda96275e8927633</originalsourceid><addsrcrecordid>eNp1kEFLxDAQhYMouK7-AG_Fi6foJGmbBE-y7qqwoLB6Dkk7Xbp02zVpD_rrTakgCF5mhpnvPYZHyCWDGwYgbwMDnUkKDKiWSlB2RGYsk4JyJdUxmQFwTgUX-pSchbADAK1kOiN3m7qv221i2zLZ1F_j2FXJyhZ1Ew8YkqEt0SevvnPWxV3o6yJ5wH3kwzk5qWwT8OKnz8n7avm2eKLrl8fnxf2aFiKVPU2FQA6yVMi1Q14qlVeKOelEmhaC5U5UCIWVVeYksw6dK63OucxQaS5zIebkevI9-O5jwNCbfR0KbBrbYjcEo0HqLGPpSF79IXfd4Nv4nFE5B5bGEiE2QYXvQvBYmYOv99Z_GgZmDNNMYZoYphnDNCxq-KQJkW236H-N_xd9A3UdddI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>862014620</pqid></control><display><type>article</type><title>Siting and Sizing of Facilities under Probabilistic Demands</title><source>Springer Nature - Complete Springer Journals</source><creator>Fernandes, Luís M. ; Júdice, Joaquim J. ; Sherali, Hanif D. ; Antunes, António P.</creator><creatorcontrib>Fernandes, Luís M. ; Júdice, Joaquim J. ; Sherali, Hanif D. ; Antunes, António P.</creatorcontrib><description>In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that facilities must satisfy a threshold level of demand (facilities are not economically viable below that level). A Mixed-Integer Nonlinear Programming (MINLP) model is proposed for this problem. A branch-and-bound algorithm is designed for solving this MINLP and its convergence to a global minimum is established. A finite procedure is also introduced to find a feasible solution for the MINLP that reduces the overall search in the binary tree generated by the branch-and-bound algorithm. Some numerical results using a GAMS/MINOS implementation of the algorithm are reported to illustrate its efficacy and efficiency in practice.</description><identifier>ISSN: 0022-3239</identifier><identifier>EISSN: 1573-2878</identifier><identifier>DOI: 10.1007/s10957-010-9783-1</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Applications of Mathematics ; Branch & bound algorithms ; Calculus of Variations and Optimal Control; Optimization ; Demand ; Economics ; Engineering ; Facilities planning ; Marketing ; Mathematical models ; Mathematics ; Mathematics and Statistics ; Nonlinear programming ; Operations Research/Decision Theory ; Optimization ; Position (location) ; Searching ; Service facilities ; Studies ; Theory of Computation ; Travel</subject><ispartof>Journal of optimization theory and applications, 2011-05, Vol.149 (2), p.420-440</ispartof><rights>Springer Science+Business Media, LLC 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c347t-433e207d8e29be2d886f81b7b344c316b3fe0ca7f5b71abebbda96275e8927633</citedby><cites>FETCH-LOGICAL-c347t-433e207d8e29be2d886f81b7b344c316b3fe0ca7f5b71abebbda96275e8927633</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10957-010-9783-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10957-010-9783-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Fernandes, Luís M.</creatorcontrib><creatorcontrib>Júdice, Joaquim J.</creatorcontrib><creatorcontrib>Sherali, Hanif D.</creatorcontrib><creatorcontrib>Antunes, António P.</creatorcontrib><title>Siting and Sizing of Facilities under Probabilistic Demands</title><title>Journal of optimization theory and applications</title><addtitle>J Optim Theory Appl</addtitle><description>In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that facilities must satisfy a threshold level of demand (facilities are not economically viable below that level). A Mixed-Integer Nonlinear Programming (MINLP) model is proposed for this problem. A branch-and-bound algorithm is designed for solving this MINLP and its convergence to a global minimum is established. A finite procedure is also introduced to find a feasible solution for the MINLP that reduces the overall search in the binary tree generated by the branch-and-bound algorithm. Some numerical results using a GAMS/MINOS implementation of the algorithm are reported to illustrate its efficacy and efficiency in practice.</description><subject>Algorithms</subject><subject>Applications of Mathematics</subject><subject>Branch & bound algorithms</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Demand</subject><subject>Economics</subject><subject>Engineering</subject><subject>Facilities planning</subject><subject>Marketing</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Nonlinear programming</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Position (location)</subject><subject>Searching</subject><subject>Service facilities</subject><subject>Studies</subject><subject>Theory of Computation</subject><subject>Travel</subject><issn>0022-3239</issn><issn>1573-2878</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kEFLxDAQhYMouK7-AG_Fi6foJGmbBE-y7qqwoLB6Dkk7Xbp02zVpD_rrTakgCF5mhpnvPYZHyCWDGwYgbwMDnUkKDKiWSlB2RGYsk4JyJdUxmQFwTgUX-pSchbADAK1kOiN3m7qv221i2zLZ1F_j2FXJyhZ1Ew8YkqEt0SevvnPWxV3o6yJ5wH3kwzk5qWwT8OKnz8n7avm2eKLrl8fnxf2aFiKVPU2FQA6yVMi1Q14qlVeKOelEmhaC5U5UCIWVVeYksw6dK63OucxQaS5zIebkevI9-O5jwNCbfR0KbBrbYjcEo0HqLGPpSF79IXfd4Nv4nFE5B5bGEiE2QYXvQvBYmYOv99Z_GgZmDNNMYZoYphnDNCxq-KQJkW236H-N_xd9A3UdddI</recordid><startdate>20110501</startdate><enddate>20110501</enddate><creator>Fernandes, Luís M.</creator><creator>Júdice, Joaquim J.</creator><creator>Sherali, Hanif D.</creator><creator>Antunes, António P.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</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>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2O</scope><scope>M2P</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></search><sort><creationdate>20110501</creationdate><title>Siting and Sizing of Facilities under Probabilistic Demands</title><author>Fernandes, Luís M. ; Júdice, Joaquim J. ; Sherali, Hanif D. ; Antunes, António P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c347t-433e207d8e29be2d886f81b7b344c316b3fe0ca7f5b71abebbda96275e8927633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Applications of Mathematics</topic><topic>Branch & bound algorithms</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Demand</topic><topic>Economics</topic><topic>Engineering</topic><topic>Facilities planning</topic><topic>Marketing</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Nonlinear programming</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Position (location)</topic><topic>Searching</topic><topic>Service facilities</topic><topic>Studies</topic><topic>Theory of Computation</topic><topic>Travel</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fernandes, Luís M.</creatorcontrib><creatorcontrib>Júdice, Joaquim J.</creatorcontrib><creatorcontrib>Sherali, Hanif D.</creatorcontrib><creatorcontrib>Antunes, António P.</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</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>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</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>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Research Library</collection><collection>Science Database</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><jtitle>Journal of optimization theory and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fernandes, Luís M.</au><au>Júdice, Joaquim J.</au><au>Sherali, Hanif D.</au><au>Antunes, António P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Siting and Sizing of Facilities under Probabilistic Demands</atitle><jtitle>Journal of optimization theory and applications</jtitle><stitle>J Optim Theory Appl</stitle><date>2011-05-01</date><risdate>2011</risdate><volume>149</volume><issue>2</issue><spage>420</spage><epage>440</epage><pages>420-440</pages><issn>0022-3239</issn><eissn>1573-2878</eissn><abstract>In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that facilities must satisfy a threshold level of demand (facilities are not economically viable below that level). A Mixed-Integer Nonlinear Programming (MINLP) model is proposed for this problem. A branch-and-bound algorithm is designed for solving this MINLP and its convergence to a global minimum is established. A finite procedure is also introduced to find a feasible solution for the MINLP that reduces the overall search in the binary tree generated by the branch-and-bound algorithm. Some numerical results using a GAMS/MINOS implementation of the algorithm are reported to illustrate its efficacy and efficiency in practice.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10957-010-9783-1</doi><tpages>21</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0022-3239 |
| ispartof | Journal of optimization theory and applications, 2011-05, Vol.149 (2), p.420-440 |
| issn | 0022-3239 1573-2878 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_907955143 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Algorithms Applications of Mathematics Branch & bound algorithms Calculus of Variations and Optimal Control Optimization Demand Economics Engineering Facilities planning Marketing Mathematical models Mathematics Mathematics and Statistics Nonlinear programming Operations Research/Decision Theory Optimization Position (location) Searching Service facilities Studies Theory of Computation Travel |
| title | Siting and Sizing of Facilities under Probabilistic Demands |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T22%3A58%3A18IST&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=Siting%20and%20Sizing%20of%20Facilities%20under%20Probabilistic%20Demands&rft.jtitle=Journal%20of%20optimization%20theory%20and%20applications&rft.au=Fernandes,%20Lu%C3%ADs%20M.&rft.date=2011-05-01&rft.volume=149&rft.issue=2&rft.spage=420&rft.epage=440&rft.pages=420-440&rft.issn=0022-3239&rft.eissn=1573-2878&rft_id=info:doi/10.1007/s10957-010-9783-1&rft_dat=%3Cproquest_cross%3E907955143%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=862014620&rft_id=info:pmid/&rfr_iscdi=true |