پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 162 |
| تعداد شماره‌ها | 6,623 |
| تعداد مقالات | 71,544 |
| تعداد مشاهده مقاله | 126,897,876 |
| تعداد دریافت فایل اصل مقاله | 99,946,117 |
A Hybrid Meta-heuristic Approach for the Capacitated Location-Routing Problem with Hard Time Windows | ||
| Advances in Industrial Engineering | ||
| مقاله 9، دوره 46، شماره 2 - شماره پیاپی 1474246، دی 2012، صفحه 219-233 اصل مقاله (491.76 K) | ||
| شناسه دیجیتال (DOI): 10.22059/jieng.2012.30564 | ||
| نویسندگان | ||
| A.R. Mohammadishad؛ P. Fattahi | ||
| چکیده | ||
| The capacitated location-routing problem (CLRP) is a new research area in logistics and distribution management. This problem combines two difficult problems: the facility location problem (FLP) and vehicle routing problem (VRP). The goal of the CLRP is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. The time windows constraint has numerous real-life applications, however there are little attention to this fact in the CLRP. This paper, considers the CLRP with hard time windows (CLRPHTW). At first, a mixed integer linear programming (MILP) formulations for the CLRPHTW is presented, then a meta-heuristic approach based on variable neighborhood search for solving the CLRPHTW is proposed. In order to evaluate the performance of the suggested method, this framework is tested on a set of instances. The experimental results show the effectiveness of the proposed approach. | ||
| کلیدواژه‌ها | ||
| Combinatorial optimization؛ Location-routing problem؛ Meta-heuristic approach؛ Time window؛ Variable neighborhood search | ||
|
آمار تعداد مشاهده مقاله: 4,241 تعداد دریافت فایل اصل مقاله: 11,177 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب