Robust optimization model for stochastic logistic problems

Chian Son Yu, Han-Lin Li

研究成果: Article同行評審

444 引文 斯高帕斯(Scopus)

摘要

The main difficulty of a logistic management problem is in the face of uncertainty about the future. Since many logistic models encounter uncertainty and noisy data in which variables or parameters have the probability of occurrence, a highly promising technique of solving stochastic optimization problems is the robust programming proposed by Mulvey et al. and Mulvey and Ruszczynski. However, heavy computational burden has prevented wider applications in practice. In this study, we reformulate a stochastic management problem as a highly efficient robust optimization model capable of generating solutions that are progressively less sensitive to the data in the scenario set. The method proposed herein to transform a robust model into a linear program only requires adding n+m variables (where n and m are the number of scenarios and total control constraints, respectively). Whereas, the current robust programming methods proposed by Mulvey et al., Mulvey and Ruszczynski and Bai et al. require adding 2n+2m. Two logistic examples, logistic management problems involving a wine company and an airline company, demonstrate the computational efficiency of the proposed model.

原文English
頁(從 - 到)385-397
頁數13
期刊International Journal of Production Economics
64
發行號1
DOIs
出版狀態Published - 1 3月 2000

指紋

深入研究「Robust optimization model for stochastic logistic problems」主題。共同形成了獨特的指紋。

引用此