An Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty
Message:
Abstract:

The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources, capabilities, and knowledge outsource their logistics services to reduce costs and increase customer satisfaction. The Third-Party Logistics (3PL) Providers have been set up to outsource various supply chain activities to specialized companies. This paper proposes a bi-objective possibilistic mixed-integer nonlinear programming model for designing a closed-loop supply chain network from the perspective of 3PL. To solve the proposed multi-objective model, a two-stage solving approach was applied first to converting the possibilistic model into its equivalent crisp counterpart and second, to converting the crisp multi-objective model into a single-objective one. Using this approach, a single-objective equivalent auxiliary crisp model was obtained and solved optimally byIBMILOGCPLEX software. Solving numerical examples proved the effectiveness of the proposed bi-objective, possibilistic framework. Several sensitivity analyses were performed to gain managerial insights.

Article Type:
Research/Original Article
Language:
English
Published:
Journal of Quality Engineering and Production Optimization, Volume:3 Issue:3, 2019
Pages:
127 - 152
magiran.com/p2051261  
روش‌های دسترسی به متن این مطلب
اشتراک شخصی
در سایت عضو شوید و هزینه اشتراک یک‌ساله سایت به مبلغ 300,000ريال را پرداخت کنید. همزمان با برقراری دوره اشتراک بسته دانلود 100 مطلب نیز برای شما فعال خواهد شد!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی همه کاربران به متن مطالب خریداری نمایند!