
تعداد نشریات | 162 |
تعداد شمارهها | 6,691 |
تعداد مقالات | 72,219 |
تعداد مشاهده مقاله | 129,106,978 |
تعداد دریافت فایل اصل مقاله | 101,910,439 |
A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System | ||
Journal of Sciences, Islamic Republic of Iran | ||
مقاله 8، دوره 23، شماره 1، خرداد 2012، صفحه 67-75 اصل مقاله (518.76 K) | ||
نویسنده | ||
F. Moeen Moghadas | ||
Ferdowsi University of Mashhad | ||
چکیده | ||
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these approaches are compared with the solutions obtained by CPLEX. Results show that using the new procedure in which sub-problems were solved with Branch and bound is better. | ||
کلیدواژهها | ||
GRASP؛ Maximal covering location problems؛ M/M/1 queueing system؛ Heuristics | ||
عنوان مقاله [English] | ||
A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System | ||
نویسندگان [English] | ||
F. Moeen Moghadas | ||
چکیده [English] | ||
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these approaches are compared with the solutions obtained by CPLEX. Results show that using the new procedure in which sub-problems were solved with Branch and bound is better. | ||
آمار تعداد مشاهده مقاله: 1,597 تعداد دریافت فایل اصل مقاله: 2,336 |