File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The reliable facility location problem: Formulations, heuristics, and approximation algorithms

TitleThe reliable facility location problem: Formulations, heuristics, and approximation algorithms
Authors
KeywordsReliable facility location problem
Approximation algorithm
Heuristics
Uncertainty
Issue Date2011
Citation
INFORMS Journal on Computing, 2011, v. 23, n. 3, p. 470-482 How to Cite?
AbstractWe study a reliable facility location problem wherein some facilities are subject to failure from time to time. If a facility fails, customers originally assigned to it have to be reassigned to other (operational) facilities. We formulate this problem as a two-stage stochastic program and then as a nonlinear integer program. Several heuristics that can produce near-optimal solutions are proposed for this NP-hard problem. For the special case where the probability that a facility fails is a constant (independent of the facility), we provide an approximation algorithm with a worst-case bound of 4. The effectiveness of our heuristics is tested by extensive computational studies, which also lead to some managerial insights. © 2011 INFORMS.
Persistent Identifierhttp://hdl.handle.net/10722/296238
ISSN
2023 Impact Factor: 2.3
2023 SCImago Journal Rankings: 1.264
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorShen, Zuo Jun Max-
dc.contributor.authorZhan, Roger Lezhou-
dc.contributor.authorZhang, Jiawei-
dc.date.accessioned2021-02-11T04:53:08Z-
dc.date.available2021-02-11T04:53:08Z-
dc.date.issued2011-
dc.identifier.citationINFORMS Journal on Computing, 2011, v. 23, n. 3, p. 470-482-
dc.identifier.issn1091-9856-
dc.identifier.urihttp://hdl.handle.net/10722/296238-
dc.description.abstractWe study a reliable facility location problem wherein some facilities are subject to failure from time to time. If a facility fails, customers originally assigned to it have to be reassigned to other (operational) facilities. We formulate this problem as a two-stage stochastic program and then as a nonlinear integer program. Several heuristics that can produce near-optimal solutions are proposed for this NP-hard problem. For the special case where the probability that a facility fails is a constant (independent of the facility), we provide an approximation algorithm with a worst-case bound of 4. The effectiveness of our heuristics is tested by extensive computational studies, which also lead to some managerial insights. © 2011 INFORMS.-
dc.languageeng-
dc.relation.ispartofINFORMS Journal on Computing-
dc.subjectReliable facility location problem-
dc.subjectApproximation algorithm-
dc.subjectHeuristics-
dc.subjectUncertainty-
dc.titleThe reliable facility location problem: Formulations, heuristics, and approximation algorithms-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1287/ijoc.1100.0414-
dc.identifier.scopuseid_2-s2.0-79961088807-
dc.identifier.volume23-
dc.identifier.issue3-
dc.identifier.spage470-
dc.identifier.epage482-
dc.identifier.eissn1526-5528-
dc.identifier.isiWOS:000293387500012-
dc.identifier.issnl1091-9856-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats