Show simple item record

dc.contributor.authorChowdhury, Niaz
dc.contributor.otherQueen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.))en
dc.date2015-11-19 16:46:06.148en
dc.date.accessioned2015-11-19T21:59:40Z
dc.date.available2015-11-19T21:59:40Z
dc.date.issued2015-11-19
dc.identifier.urihttp://hdl.handle.net/1974/13836
dc.descriptionThesis (Master, Chemical Engineering) -- Queen's University, 2015-11-19 16:46:06.148en
dc.description.abstractSupply Chain Optimization (SCO) problem under uncertainty can be modeled as two-stage optimization problem where first-stage decisions are associated with design and development of facilities and second-stage decisions are associated with operation of the supply chain network. Recently, a robust scenario approach combing the traditional scenario or robust approach has been developed to better address uncertainties in SCO problems, and it can ensure solution feasibility and better expected objective value. But this approach can only address uncertainties bounded with the infinity-norm. This thesis proposes a modified robust scenario approach, which can be used to address uncertainty region bounded with the p-norm in SCO. In this case, after the normalization of the uncertainty region, the smallest box uncertainty region, that covers the normalized uncertainty region, can be partitioned into a number of box uncertainty subregions. Following some screening criteria, two subsets of the subregions that over-estimates and under-estimates the original uncertainty region can be selected. When the number of scenarios increases, the optimal objective values of the two robust scenario formulations converge to a constant, which is a good estimate of the true optimal value. This new robust scenario approach is then extended for any bounded uncertainty regions, in the context of robust optimization. In many industrial problem, the historical realizations of uncertain parameters are known. This thesis gives a preliminary discussion on a data driven robust scenario approach, where the available data are normalized and a reference box that covers the data with a certain confidence is constructed. Then, the reference box is partitioned into box-shaped uncertainty subregions. The benefits of the proposed robust scenario approach are demonstrated through some simple examples as well as an industrial SCO problem. The approach requires the solution of large-scale optimization problems when the number of scenarios is large, and these large-scale problems have a decomposable structure that can be exploited for efficient solution via decomposition-based optimization. A computational study demonstrates that, when the large-scale optimization problem is a second-order cone programming problem, generalized Benders decomposition is much faster than a state-of-the-art optimization solver.en_US
dc.languageenen
dc.language.isoenen_US
dc.relation.ispartofseriesCanadian thesesen
dc.rightsQueen's University's Thesis/Dissertation Non-Exclusive License for Deposit to QSpace and Library and Archives Canadaen
dc.rightsProQuest PhD and Master's Theses International Dissemination Agreementen
dc.rightsIntellectual Property Guidelines at Queen's Universityen
dc.rightsCopying and Preserving Your Thesisen
dc.rightsCreative Commons - Attribution - CC BYen
dc.rightsThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.en
dc.subjectSupply Chain Optimizationen_US
dc.subjectp-Normen_US
dc.subjectGeneralized Benders Decompositionen_US
dc.subjectUncertaintyen_US
dc.titleA New Robust Scenario Approach to Supply Chain Optimization under Bounded Uncertaintyen_US
dc.typethesisen_US
dc.description.degreeMasteren
dc.contributor.supervisorLi, Xiangen
dc.contributor.departmentChemical Engineeringen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record