A H E U R I S T I C M E T H O D F O R T H E I N T E G R A T E D M U L T I-D E P O T C O N T I N U O U S L O C A T I O N-R O U T I N G A N D I N V E N T O R Y P R O B L E M
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this study a mathematical model has been presented for multi depots, continuous location-routing problem with inventory restrictions. In this problem, a three-echelon supply chain was assumed a factory, producing one product with unlimited capacity, is on the first echelon of supply chain. In the second echelon of supply chain, several distribution centers distribute products. In the third echelon, there is a set of customers who are scattered in different geographical locations. Location of customers is pre-specified, but distribution centers should be located. In this problem, location of distribution centers will be determined in a continuous space.
As the leader of this supply chain, factory is looking for product distribution planning to minimize the total cost of this system. Model formulation of this problem is NP-hard; so a meta-heuristic algorithm with three phases has been developed for medium and large sizes of this problem. In the first phase of this algorithm, Region-rejection approach and modified saving algorithm are used to generate initial solution. In the second phase, we apply the Weiszfeld algorithm in order to improve location-routing decisions repeatedly. In the last phase, diversification and intensification mechanisms are incorporated into the search.
The proposed algorithm is able to improve even the best solution implemented by GAMS solver with time limits of 10800 seconds and 18000 seconds, 0.62 percent in average, with much less computational effort. Also it can be seen that this algorithm is moving toward the best solution during three phases. For this small sized problem, each of the three main phases, the average percentage deviation from optimal solution is only % 0.07, % 0.05, % 0.03 and % 0.02, respectively. For medium and large size of this problem, % 2.83, %1.89 and %1.29 improvement can be seen in each phase compared to the previous phase, respectively. This improvement is impressive for the large size of this problem.
As the leader of this supply chain, factory is looking for product distribution planning to minimize the total cost of this system. Model formulation of this problem is NP-hard; so a meta-heuristic algorithm with three phases has been developed for medium and large sizes of this problem. In the first phase of this algorithm, Region-rejection approach and modified saving algorithm are used to generate initial solution. In the second phase, we apply the Weiszfeld algorithm in order to improve location-routing decisions repeatedly. In the last phase, diversification and intensification mechanisms are incorporated into the search.
The proposed algorithm is able to improve even the best solution implemented by GAMS solver with time limits of 10800 seconds and 18000 seconds, 0.62 percent in average, with much less computational effort. Also it can be seen that this algorithm is moving toward the best solution during three phases. For this small sized problem, each of the three main phases, the average percentage deviation from optimal solution is only % 0.07, % 0.05, % 0.03 and % 0.02, respectively. For medium and large size of this problem, % 2.83, %1.89 and %1.29 improvement can be seen in each phase compared to the previous phase, respectively. This improvement is impressive for the large size of this problem.
Keywords:
Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:33 Issue: 2, 2018
Pages:
95 to 104
magiran.com/p1843877
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!