سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات158
تعداد شماره‌ها6,230
تعداد مقالات67,764
تعداد مشاهده مقاله115,156,208
تعداد دریافت فایل اصل مقاله89,913,496
Moeen Moghadas, F.. (1390). A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System. , 23(1), 67-75.
F. Moeen Moghadas. "A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System". , 23, 1, 1390, 67-75.
Moeen Moghadas, F.. (1390). 'A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System', , 23(1), pp. 67-75.
Moeen Moghadas, F.. A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System. , 1390; 23(1): 67-75.

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,545
تعداد دریافت فایل اصل مقاله: 2,233


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب