D E V E L O P I N G A B I-L E V E L P R O G R A M M I N G M O D E L F O R P R O C U R E M E N T M A N A G E M E N T A N D A H Y B R I D A L G O R I T H M F O R I T S S O L U T I O N
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this paper, we deal with a procurement problem in a decentralized two-echelon supply chain, in which a buyer (manufacturer) aims to procure a bundle of needed items from a number of suppliers. The problem is modeled via a bi-level programming model, in which the buyer acts as a leader and the suppliers separately act as followers on lower level. To solve this bi-level mathematical model, a hybrid algorithm based on particle swarm optimization (PSO-A*) is proposed. The proposed mechanism, by satisfying the partner's constraints, is able to reach a near-optimal solution which persuades the partners to contract. In this paper, a comprehensive pattern is proposed for embedding the negotiation process in mathematical models and their solution procedure. This study aims at developing a bi-level programming to deal with a negotiation-based procurement problem, according to the realistic assumptions, in which the buyer is considered as a leader and makes optimal decisions according to supplier's proposals in lower level as followers. Such a mechanism provides an alignment among supplier's production planning and order allocation to avoid instantaneous orders, inability of suppliers to supply orders, and impose high inventory cost. In addition, it supports the partnership with valued suppliers through suitable order allocation by taking supplier's capacities into consideration. This research has been done based on the assumptions derived from the interviews with the experts in supplying automotive parts company called SAPCO and a number of its partners. To evaluate the performance of the proposed algorithm, the results of the PSO-A* algorithm are compared with those of PSO-Exact and PSO-Greedy algorithms. Based on computational analysis, it can be observed that the PSO-A* algorithm is more efficient compared to the PSO algorithm in which its lower level sub problems are solved through an exact solver; it is also more effective compared to the PSO-Greedy algorithm.
Keywords:
Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:33 Issue: 2, 2017
Pages:
21 to 33
magiran.com/p1829810
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!