کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6893138 | 699353 | 2013 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
ترجمه فارسی عنوان
اکتشافات جستجوی پرتو برای چند ویبری چند وجهی چند وجهی چند وجهی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
تخصیص موقعیت مکانی حمل و نقل، شعبه و مرز، جستجوی پرتو،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
The Multi-facility Weber Problem (MWP) is concerned with locating I uncapacitated facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost of a single commodity. It is a non-convex optimization problem and difficult to solve. In this work, we focus on the capacitated extensions of the MWP which are Capacitated MWP (CMWP) and multi-commodity CMWP (MCMWP). Both the CMWP and MCMWP impose capacity restrictions on facilities. Indeed, the MCMWP is a natural extension of the CMWP and considers the situation where K distinct commodities are shipped subject to limitations on the total amount of goods sent from facilities to the customers. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which depend on the commodity type, are proportional to the distance between customers and facilities. We first introduce branch and bound algorithms for both the CMWP and the MCMWP then we propose beam search heuristics for these problems. According to our computational experiments on standard and randomly generated test instances, we can say that the new heuristics perform very well.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 12, December 2013, Pages 3056-3068
Journal: Computers & Operations Research - Volume 40, Issue 12, December 2013, Pages 3056-3068
نویسندگان
M. Hakan Akyüz, Temel Ãncan, Ä°. Kuban Altınel,