Sixiang Zhao

Dr. Sixiang Zhao

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2017 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
SZSixiang Zhao
Sixiang Zhao
XLXiao Liu
Xiao Liu
YZY. Zhuo
Y. Zhuo

18 April 2018 in IISE Transactions
Verified
Journal Article
Closed access
SZSixiang Zhao
Sixiang Zhao
WHWilliam Benjamin Haskell
William Benjamin Haskell
MCMichel-Alexandre Cardin
Michel-Alexandre Cardin
Strategic capacity planning for multiple-facility systems with flexible designs is an important topic in the area of capacity expansion problems with random demands. The difficulties of this problem lie in the multidimensional nature of its random variables and action space. For a single-facility problem, the decision rule method has been shown to be efficient in deriving desirable solutions, but for a Multiple-facility Capacity Expansion Problem (MCEP), it has not been well studied. This article designs a novel decision rule–based method for the solution of an MCEP with multiple options, discrete capacity, and a concave capacity expansion cost. An if–then decision rule is designed and the original multi-stage problem is thus transformed into a master problem and a multi-period sub-problem. As the sub-problem contains non-binding constraints, we combine a stochastic approximation algorithm with a branch-and-cut technique so that the sub-problem can be further decomposed across scenarios and be solved efficiently. The proposed decision rule–based method is also extended to solving the MCEP with fixed costs. Numerical studies in this article illustrate that the proposed method affords not only improved performance relative to an inflexible design taken as benchmark but also time savings relative to approximate dynamic programming analysis.

1 January 2020 in Mathematical Methods of Operations Research
Verified
Journal Article
Closed access
PDF file
BWBo Wei
Bo Wei
WHWilliam B. Haskell
William B. Haskell
SZSixiang Zhao
Sixiang Zhao

1 January 2016 in IFAC-PapersOnLine
Verified
Journal Article
Closed access
SZSixiang Zhao
Sixiang Zhao
XLX. Liu
X. Liu
YZY. Zhuo
Y. Zhuo

30 March 2023 in Mathematical Methods of Operations Research
Verified
Journal Article
Closed access
PDF file
SZSixiang Zhao
Sixiang Zhao

9 February 2023 in IISE Transactions
Verified
Journal Article
Closed access
DZDali Zhang
Dali Zhang
LJLingyun Ji
Lingyun Ji
SZSixiang Zhao
Sixiang Zhao
LWLizhi Wang
Lizhi Wang
This paper proposes a variable-sample method for the computation of stochastic stable Nash equilibrium, in which the objective functions are approximated, in each iteration, by the sample average approximation with different sample sizes. We start by investigating the contraction mapping properties under the variable-sample framework. Under some moderate conditions, it is shown that the accumulation points attained from the algorithm satisfy the first order equilibrium conditions with probability one. Moreover, we use the asymptotic unbiasedness condition to prove the convergence of the accumulation points of the algorithm into the set of fixed points and prove the finite termination property of the algorithm. We also verify that the algorithm converges to the equilibrium even if the optimization problems in each iteration are solved inexactly. In the numerical tests, we comparatively analyze the accuracy error and the precision error of the estimators with different sample size schedules with respect to the sampling loads and the computational times. The results validate the effectiveness of the algorithm.