TY - JOUR ID - 24571 TI - A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System JO - Journal of Sciences, Islamic Republic of Iran JA - JSCIENCES LA - en SN - 1016-1104 AU - Moeen Moghadas, F. AD - Ferdowsi University of Mashhad Y1 - 2012 PY - 2012 VL - 23 IS - 1 SP - 67 EP - 75 KW - GRASP KW - Maximal covering location problems KW - M/M/1 queueing system KW - Heuristics DO - N2 - 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. UR - https://jsciences.ut.ac.ir/article_24571.html L1 - https://jsciences.ut.ac.ir/article_24571_3eb964a41c5f135d51aceb5db1223217.pdf ER -