Advances in Decision Sciences
Volume 2011 (2011), Article ID 605629, 13 pages
Research Article

Queueing Maximal Covering Location-Allocation Problem: An Extension with M/G/1 Queueing Systems

Department of Mathematics, Ferdowsi University of Mashhad, Vakil Abad Boulevard, Mashhad 91775-1159, Iran

Received 8 January 2011; Revised 28 August 2011; Accepted 7 November 2011

Academic Editor: Roger Z. RĂ­os-Mercado

Copyright © 2011 Foroogh Moeen Moghadas and Hossein Taghizadeh Kakhki. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the sub-problems, as well as the entire model. Some computational results are also presented.