Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/91254
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | Li, Y | en_US |
dc.creator | Li, X | en_US |
dc.creator | Shu, J | en_US |
dc.creator | Song, M | en_US |
dc.creator | Zhang, K | en_US |
dc.date.accessioned | 2021-10-19T08:27:31Z | - |
dc.date.available | 2021-10-19T08:27:31Z | - |
dc.identifier.issn | 1091-9856 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/91254 | - |
dc.language.iso | en | en_US |
dc.publisher | Informs | en_US |
dc.rights | © 2021 INFORMS | en_US |
dc.rights | This is the accepted manuscript of the following article: Yongzhen Li, Xueping Li, Jia Shu, Miao Song, Kaike Zhang (2021) A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions. INFORMS Journal on Computing 34(1):407-426, which has been published in final form at https://doi.org/10.1287/ijoc.2021.1063. | en_US |
dc.subject | Uncapacitated facility location | en_US |
dc.subject | Uncertain facility disruptions | en_US |
dc.subject | Stochastic and distributionally robust optimizations | en_US |
dc.subject | Cutting plane | en_US |
dc.subject | Column generation | en_US |
dc.title | A general model and efficient algorithms for reliable facility location problem under uncertain disruptions | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 407 | en_US |
dc.identifier.epage | 426 | en_US |
dc.identifier.volume | 34 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.doi | 10.1287/ijoc.2021.1063 | en_US |
dcterms.abstract | This paper studies the reliable uncapacitated facility location problem in which facilities are subject to uncertain disruptions. A two-stage distributionally robust model is formulated, which optimizes the facility location decisions so as to minimize the fixed facility location cost and the expected transportation cost of serving customers under the worst-case disruption distribution. The model is formulated in a general form, where the uncertain joint distribution of disruptions is partially characterized and is allowed to have any prespecified dependency structure. This model extends several related models in the literature, including the stochastic one with explicitly given disruption distribution and the robust one with moment information on disruptions. An efficient cutting plane algorithm is proposed to solve this model, where the separation problem is solved respectively by a polynomial-time algorithm in the stochastic case and by a column generation approach in the robust case. Extensive numerical study shows that the proposed cutting plane algorithm not only outperforms the best-known algorithm in the literature for the stochastic problem under independent disruptions but also efficiently solves the robust problem under correlated disruptions. The practical performance of the robust models is verified in a simulation based on historical typhoon data in China. The numerical results further indicate that the robust model with even a small amount of information on disruption correlation can mitigate the conservativeness and improve the location decision significantly. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | INFORMS journal on computing, Jan.-Feb. 2022, v. 34, no. 1, p. 407-426 | en_US |
dcterms.isPartOf | INFORMS journal on computing | en_US |
dcterms.issued | 2022-01 | - |
dc.identifier.eissn | 1526-5528 | en_US |
dc.description.validate | 202110 bchy | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0792-n01, RGC-B1-019 | - |
dc.identifier.SubFormID | 1641 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | NSFC, Jiangsu Provincial Six Talent Peaks Project, Jiangsu Province“333”Project, National Science Foundation, Ideation Laboratory (iLab) at the University of Tennessee, Knoxville | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Li_Efficient_Algorithms_Reliable.pdf | Pre-Published version | 1.48 MB | Adobe PDF | View/Open |
Page views
208
Last Week
0
0
Last month
Citations as of Mar 24, 2024
Downloads
96
Citations as of Mar 24, 2024
SCOPUSTM
Citations
7
Citations as of Mar 29, 2024
WEB OF SCIENCETM
Citations
7
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.