A Modified Benders Decomposition Algorithm for Supply Chain Network Design under Risk Consideration
Author(s):
Abstract:
In todays competitive business environment, the design and management of supply chain network is one of the most important challenges that managers encounter. The supply chain network should be designed for satisfying of customer demands as well as minizing the total system costs. This paper presents a multi-period multi-stage supply chain network design problem under demand uncertainty. The problem is formulated as a two-stage stochastic program. In the first-stage, strategic location decisions are made, while the second-stage contains the tactical decisions. In our developed model, conditional value-at-risk (CVaR) as an effective risk measure is used to produce first-stage decisions in which the loss cost in the second-stage is minimized. In addition, a modified Benders decomposition algorithm is developed to solve the model exactly. The computational results on a set of randomly generated problem instances demonstrate the effectiveness of the proposed algorithm in terms of the solution quality.
Keywords:
Language:
English
Published:
Journal of Quality Engineering and Production Optimization, Volume:1 Issue: 1, Winter - Spring 2015
Pages:
55 to 66
magiran.com/p1513899
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!