On solving the discrete location problems when the facilities are prone to failure
The classical discrete location problem is extended here, where the candidate facilities are subject to failure. The unreliable location problem is defined by introducing the probability that a facility may become inactive. The formulation and the solution procedure have been motivated by an applica...
Uložené v:
| Vydané v: | Applied mathematical modelling Ročník 31; číslo 5; s. 817 - 831 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
Elsevier Inc
01.05.2007
Elsevier Science |
| Predmet: | |
| ISSN: | 0307-904X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The classical discrete location problem is extended here, where the candidate facilities are subject to failure. The unreliable location problem is defined by introducing the probability that a facility may become inactive. The formulation and the solution procedure have been motivated by an application to model and solve a large size problem for locating base stations in a cellular communication network. We formulate the unreliable discrete location problems as 0–1 integer programming models, and implement an enhanced dual-based solution method to determine locations of these facilities to minimize the sum of fixed cost and expected operating (transportation) cost. Computational tests of some well-known problems have shown that the heuristic is efficient and effective for solving these unreliable location problems. |
|---|---|
| AbstractList | The classical discrete location problem is extended here, where the candidate facilities are subject to failure. The unreliable location problem is defined by introducing the probability that a facility may become inactive. The formulation and the solution procedure have been motivated by an application to model and solve a large size problem for locating base stations in a cellular communication network. We formulate the unreliable discrete location problems as 0–1 integer programming models, and implement an enhanced dual-based solution method to determine locations of these facilities to minimize the sum of fixed cost and expected operating (transportation) cost. Computational tests of some well-known problems have shown that the heuristic is efficient and effective for solving these unreliable location problems. |
| Author | Chang, Wen-Tin Lee, Shine-Der |
| Author_xml | – sequence: 1 givenname: Shine-Der surname: Lee fullname: Lee, Shine-Der email: shindlee@mail.ncku.edu.tw – sequence: 2 givenname: Wen-Tin surname: Chang fullname: Chang, Wen-Tin |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18436706$$DView record in Pascal Francis |
| BookMark | eNp9kE1LAzEQhnOoYFv9Ad72oreuSXa72cWTFL-gUBAFbyGbndiUbFKTtOK_N_0AwUNPw8w87zA8IzSwzgJCVwTnBJPqdpWLdZ9TjKc5oTkmdICGuMBs0uDy4xyNQljhtEzdEL0ubBac2Wr7mcUlZJ0O0kOEzDgponY2W3vXGuhD9r0Eu2eUkNroqCFkwsMOsJBFl-babDxcoDMlTIDLYx2j98eHt9nzZL54epndzyeymNZxwgSQpipZUdZEEaqmTNWpgqyVxA1pCesKpgQltWjrspCkpmVFm66GSnVtK4sxujncTQ98bSBE3qfnwRhhwW0Cp01ZNU3BEnh9BEWQwigvrNSBr73uhf_hJF2vGK4SRw6c9C4ED-oPwXxnlq94Mst3ZjmhPJlNGfYvI3Xci4s-6TiZvDskITnaavA8SA1WQqc9yMg7p0-kfwEhmpeD |
| CODEN | AMMODL |
| CitedBy_id | crossref_primary_10_1243_09544054JEM1349 crossref_primary_10_1016_j_apm_2017_11_010 crossref_primary_10_1016_j_ejor_2016_10_013 crossref_primary_10_1016_j_cor_2015_02_003 crossref_primary_10_1016_j_cor_2024_106896 crossref_primary_10_1080_0305215X_2014_947973 crossref_primary_10_1007_s40815_021_01208_5 |
| Cites_doi | 10.1007/BFb0120715 10.1016/0377-2217(95)00182-4 10.1016/0305-0548(94)00033-5 10.1287/opre.14.3.361 10.1287/opre.44.6.864 10.1057/jors.1987.88 10.1287/opre.26.6.992 10.1145/362588.362593 10.1287/mnsc.10.2.225 10.1002/nav.3800200111 10.1080/07408178908966240 10.1016/S0377-2217(97)00303-2 10.1016/S0305-0548(99)00120-3 10.1287/mnsc.35.6.645 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier Inc. 2007 INIST-CNRS |
| Copyright_xml | – notice: 2006 Elsevier Inc. – notice: 2007 INIST-CNRS |
| DBID | 6I. AAFTH AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.apm.2005.12.012 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis 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 | Mathematics Applied Sciences |
| EndPage | 831 |
| ExternalDocumentID | 18436706 10_1016_j_apm_2005_12_012 S0307904X05002763 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6I. 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO ABAOU ABEFU ABFNM ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ADBBV ADEZE ADMUD ADTZH AEBSH AECPX AEKER AENEX AEXQZ AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HZ~ IHE IXB J1W JJJVA KOM LG9 LY7 M26 M41 MHUIS MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSW SSZ T5K TN5 WH7 WUQ XJT XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c358t-7ae196473481f12f57f8f12ec8fc091b17d37fa218ab843c1824629d8e6fdbbc3 |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000243828500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0307-904X |
| IngestDate | Sat Sep 27 23:33:43 EDT 2025 Mon Jul 21 09:16:58 EDT 2025 Tue Nov 18 21:22:08 EST 2025 Sat Nov 29 03:21:27 EST 2025 Fri Feb 23 02:30:29 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Discrete location model Site selection Unreliable facilities Heuristic Mobile radiocommunication Probabilistic approach Cellular radio Telephone network Fixed cost Modular system Rupture Operating cost Cell network Communication network Failures Modeling Location problem Facility location Integer programming Heuristic method Telecommunication network |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c358t-7ae196473481f12f57f8f12ec8fc091b17d37fa218ab843c1824629d8e6fdbbc3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.apm.2005.12.012 |
| PQID | 29469937 |
| PQPubID | 23500 |
| PageCount | 15 |
| ParticipantIDs | proquest_miscellaneous_29469937 pascalfrancis_primary_18436706 crossref_primary_10_1016_j_apm_2005_12_012 crossref_citationtrail_10_1016_j_apm_2005_12_012 elsevier_sciencedirect_doi_10_1016_j_apm_2005_12_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-05-01 |
| PublicationDateYYYYMMDD | 2007-05-01 |
| PublicationDate_xml | – month: 05 year: 2007 text: 2007-05-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | Applied mathematical modelling |
| PublicationYear | 2007 |
| Publisher | Elsevier Inc Elsevier Science |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier Science |
| References | ReVelle, Laporte (bib6) 1996; 44 Schrage (bib3) 1975; 4 Drezner (bib8) 1987; 38 Efroymson, Ray (bib1) 1966; 14 Drezner (bib14) 1995; 22 Krolak, Felts, Marble (bib13) 1971; 14 Lee (bib9) 2001; 28 Marianov, ReVelle (bib11) 1996; 93 Erlenkotter (bib4) 1978; 26 Khumawala (bib2) 1973; 20 Brandeau, Chiu (bib5) 1989; 35 Pirkul (bib7) 1989; 21 Karg, Thompson (bib12) 1964; 10 Current, Ratick, ReVelle (bib10) 1998; 110 Erlenkotter (10.1016/j.apm.2005.12.012_bib4) 1978; 26 Karg (10.1016/j.apm.2005.12.012_bib12) 1964; 10 Marianov (10.1016/j.apm.2005.12.012_bib11) 1996; 93 Current (10.1016/j.apm.2005.12.012_bib10) 1998; 110 Brandeau (10.1016/j.apm.2005.12.012_bib5) 1989; 35 Pirkul (10.1016/j.apm.2005.12.012_bib7) 1989; 21 ReVelle (10.1016/j.apm.2005.12.012_bib6) 1996; 44 Khumawala (10.1016/j.apm.2005.12.012_bib2) 1973; 20 Drezner (10.1016/j.apm.2005.12.012_bib8) 1987; 38 Krolak (10.1016/j.apm.2005.12.012_bib13) 1971; 14 Lee (10.1016/j.apm.2005.12.012_bib9) 2001; 28 Efroymson (10.1016/j.apm.2005.12.012_bib1) 1966; 14 Drezner (10.1016/j.apm.2005.12.012_bib14) 1995; 22 Schrage (10.1016/j.apm.2005.12.012_bib3) 1975; 4 |
| References_xml | – volume: 35 start-page: 645 year: 1989 end-page: 674 ident: bib5 article-title: An overview of representative problems in location research publication-title: Manage. Sci. – volume: 21 start-page: 337 year: 1989 end-page: 348 ident: bib7 article-title: Uncapacitated facility location problem with primary and secondary facility requirements publication-title: IIE Trans. – volume: 26 start-page: 992 year: 1978 end-page: 1009 ident: bib4 article-title: A dual-based procedure for uncapacitated facility location publication-title: Operat. Res. – volume: 38 start-page: 509 year: 1987 end-page: 514 ident: bib8 article-title: Heuristic solution methods for two location problems with unreliable facility publication-title: J. Operat. Res. Soc. – volume: 44 start-page: 864 year: 1996 end-page: 874 ident: bib6 article-title: Plant location problem: new models and research prospects publication-title: Operat. Res. – volume: 22 start-page: 525 year: 1995 end-page: 530 ident: bib14 article-title: On the conditional publication-title: Comput. Operat. Res. – volume: 14 start-page: 361 year: 1966 end-page: 368 ident: bib1 article-title: A branch-and-bound algorithm for plant location publication-title: Operat. Res. – volume: 93 start-page: 110 year: 1996 end-page: 120 ident: bib11 article-title: The queuing maximal availability location problem—A model for the sitting of emergency vehicles publication-title: Eur. J. Operat. Res. – volume: 110 start-page: 597 year: 1998 end-page: 609 ident: bib10 article-title: Dynamic facility location when the total number of facilities is uncertain: a decision analysis approach publication-title: Eur. J. Operat. Res. – volume: 28 start-page: 329 year: 2001 end-page: 344 ident: bib9 article-title: On solving unreliable planar location problems publication-title: Comput. Operat. Res. – volume: 10 start-page: 225 year: 1964 end-page: 248 ident: bib12 article-title: A heuristic approach to solving traveling salesman problems publication-title: Manage. Sci. – volume: 20 start-page: 109 year: 1973 end-page: 121 ident: bib2 article-title: An efficient heuristic procedure for the uncapacitated warehouse location problem publication-title: Naval Res. Logist. Quart. – volume: 4 start-page: 118 year: 1975 end-page: 132 ident: bib3 article-title: Implicit representation of variable upper bounds in linear programming publication-title: Math. Program. Study – volume: 14 start-page: 327 year: 1971 end-page: 334 ident: bib13 article-title: A man–machine approach toward solving the traveling salesman problems publication-title: Commun. ACM – volume: 4 start-page: 118 year: 1975 ident: 10.1016/j.apm.2005.12.012_bib3 article-title: Implicit representation of variable upper bounds in linear programming publication-title: Math. Program. Study doi: 10.1007/BFb0120715 – volume: 93 start-page: 110 issue: 1 year: 1996 ident: 10.1016/j.apm.2005.12.012_bib11 article-title: The queuing maximal availability location problem—A model for the sitting of emergency vehicles publication-title: Eur. J. Operat. Res. doi: 10.1016/0377-2217(95)00182-4 – volume: 22 start-page: 525 issue: 5 year: 1995 ident: 10.1016/j.apm.2005.12.012_bib14 article-title: On the conditional p-median problem publication-title: Comput. Operat. Res. doi: 10.1016/0305-0548(94)00033-5 – volume: 14 start-page: 361 year: 1966 ident: 10.1016/j.apm.2005.12.012_bib1 article-title: A branch-and-bound algorithm for plant location publication-title: Operat. Res. doi: 10.1287/opre.14.3.361 – volume: 44 start-page: 864 issue: 6 year: 1996 ident: 10.1016/j.apm.2005.12.012_bib6 article-title: Plant location problem: new models and research prospects publication-title: Operat. Res. doi: 10.1287/opre.44.6.864 – volume: 38 start-page: 509 issue: 6 year: 1987 ident: 10.1016/j.apm.2005.12.012_bib8 article-title: Heuristic solution methods for two location problems with unreliable facility publication-title: J. Operat. Res. Soc. doi: 10.1057/jors.1987.88 – volume: 26 start-page: 992 issue: 6 year: 1978 ident: 10.1016/j.apm.2005.12.012_bib4 article-title: A dual-based procedure for uncapacitated facility location publication-title: Operat. Res. doi: 10.1287/opre.26.6.992 – volume: 14 start-page: 327 year: 1971 ident: 10.1016/j.apm.2005.12.012_bib13 article-title: A man–machine approach toward solving the traveling salesman problems publication-title: Commun. ACM doi: 10.1145/362588.362593 – volume: 10 start-page: 225 year: 1964 ident: 10.1016/j.apm.2005.12.012_bib12 article-title: A heuristic approach to solving traveling salesman problems publication-title: Manage. Sci. doi: 10.1287/mnsc.10.2.225 – volume: 20 start-page: 109 year: 1973 ident: 10.1016/j.apm.2005.12.012_bib2 article-title: An efficient heuristic procedure for the uncapacitated warehouse location problem publication-title: Naval Res. Logist. Quart. doi: 10.1002/nav.3800200111 – volume: 21 start-page: 337 issue: 4 year: 1989 ident: 10.1016/j.apm.2005.12.012_bib7 article-title: Uncapacitated facility location problem with primary and secondary facility requirements publication-title: IIE Trans. doi: 10.1080/07408178908966240 – volume: 110 start-page: 597 issue: 3 year: 1998 ident: 10.1016/j.apm.2005.12.012_bib10 article-title: Dynamic facility location when the total number of facilities is uncertain: a decision analysis approach publication-title: Eur. J. Operat. Res. doi: 10.1016/S0377-2217(97)00303-2 – volume: 28 start-page: 329 issue: 4 year: 2001 ident: 10.1016/j.apm.2005.12.012_bib9 article-title: On solving unreliable planar location problems publication-title: Comput. Operat. Res. doi: 10.1016/S0305-0548(99)00120-3 – volume: 35 start-page: 645 year: 1989 ident: 10.1016/j.apm.2005.12.012_bib5 article-title: An overview of representative problems in location research publication-title: Manage. Sci. doi: 10.1287/mnsc.35.6.645 |
| SSID | ssj0005904 |
| Score | 1.8424888 |
| Snippet | The classical discrete location problem is extended here, where the candidate facilities are subject to failure. The unreliable location problem is defined by... |
| SourceID | proquest pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 817 |
| SubjectTerms | Applied sciences Discrete location model Exact sciences and technology Heuristic Logistics Operational research and scientific management Operational research. Management science Site selection Unreliable facilities |
| Title | On solving the discrete location problems when the facilities are prone to failure |
| URI | https://dx.doi.org/10.1016/j.apm.2005.12.012 https://www.proquest.com/docview/29469937 |
| Volume | 31 |
| WOSCitedRecordID | wos000243828500003&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: Elsevier SD Freedom Collection Journals 2021 issn: 0307-904X databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 20180131 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0005904 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZQywGEUMtDXaCtD5xYBSV2HvaxKkWAoEWwiL1FthOrrbbparMt_fnMxHbSh1rRA5ds5HXiJPPFHjvffEPI27xTXIlVJKqKRaniWaS51lGqrVBpJhU3nc7s12J_X0yn8rvn6bZdOoGiacTFhZz_V1NDGRgbQ2fvYe7-pFAA-2B02ILZYftPhj9oxtDAeQiDwrDbBXjGYxy1OmP7HDLt-M9h7UiOVhmkyMKkeYxEMKjQdBk1rDqaecWRXqnWe60nvdwrhp9gOp1ZGAQHes_PQ_Bhow8DAXg3LE__rpto4kW_w5pDMTD8QqwVlMnYcStDP8qTS3jJLnWKwkVnhvHV1bvRdbtVhOP3an7ilrpwldZTrK_IZF8bvnpSYeCrHZdwCkyvmZUJK2NMQb3KikxCt72683lv-mWgAMk4DUKZeDfhq3fH_7t2Hbf5LU_mqoUnbV0alBsjeuemTNbIUz-_oDsOF-vkQd08I4-_9dZqn5MfBw31CKFQTANCaEAIDQihiJCuzoAQCgihHULo8pR6hLwgvz7uTXY_RT61RmR4JpZRoWpUYkNpo8QmzGaFFfBbG2ENeJA6KSpeWAX-n9Ii5QZmoWnOZCXq3FZaG_6SrDTQ0gah8J-2GIeL2nCaSc3i3Jpacp2kWcWyEYnDgyuN153H9Cez8laDjci7_pC5E125q3IarFF6r9F5gyUg667Dtq5YbmgI7jcv4nxEtoMpS-hy8TuaaurTs7ZkMs3RrX91n8t8TR4Nb9IbsrJcnNWb5KE5Xx61iy2PzL_Z7aRC |
| 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=On+solving+the+discrete+location+problems+when+the+facilities+are+prone+to+failure&rft.jtitle=Applied+mathematical+modelling&rft.au=Lee%2C+Shine-Der&rft.au=Chang%2C+Wen-Tin&rft.date=2007-05-01&rft.issn=0307-904X&rft.volume=31&rft.issue=5&rft.spage=817&rft.epage=831&rft_id=info:doi/10.1016%2Fj.apm.2005.12.012&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_apm_2005_12_012 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0307-904X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0307-904X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0307-904X&client=summon |