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

摘要

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/G/l 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.