A robust optimization model for stochastic logistic problems

Chian-Son Yu

doi:10.1016/S0925-5273(99)00074-2

A robust optimization model for stochastic logistic problems

2000-03-01

457

PRE

AI

DOI：10.1016/S0925-5273(99)00074-2

原文链接

原文求助

摘要

En 中文

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. (Operations Research 43(2) (1995a) 264-281) and Mulvey and Ruszczynski (Operations Research 43 (3) (1995b) 477-490). 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 Pt al., Mulvey and Ruszczynski and Bai et al, (Management Science 43 (7)(1997) 895-907) 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. (C) 2000 Elsevier Science B.V. All rights reserved.

Keyword:

goal programming

robust optimization

stochastic programming

logistic problem

A robust optimization model for stochastic logistic problems

摘要

AI总结

期刊

机构

引用论文