دوشنبه 17 اردیبهشت 1403
| عنوان مقاله | |
| عنوان مقاله |
A survey of the standard location-routing problem |
| عنوان فارسی مقاله | بررسی مسئله مسیریابی استاندارد |
| مشخصات مقاله انگلیسی | |
| نشریه: Springer |
|
| سال انتشار |
2017 |
| عنوان مجله |
Annals of Operations Research |
| تعداد صفحات مقاله انگلیسی | 26 |
| رفرنس | دارد |
| تعداد رفرنس | 101 |
| چکیده مقاله | |
| چکیده |
In this paper, we define the standard LRP as a deterministic, static, discrete, single- echelon, single-objective location-routing problem in which each customer (vertex) must be visited exactly once for the delivery of a good from a facility, and in which no inventory decisions are relevant. We review the literature on the standard LRP published since the survey by Nagy and Salhi appeared in 2006. We provide concise paper excerpts that convey the central ideas of each work, discuss recent developments in the field, provide a numerical comparison of the most successful heuristic algorithms, and list promising topics for further research. |
| کلمات کلیدی |
|
| دانلود | |
