Title : ( Queueing Covering Maximal Location-Allocation Problem: An Extension with M/G/1 Sysytems )
Authors: foroogh moeen moghadas , Hossein Taghizadeh Kakhki ,
Full TextAbstract
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 subproblems, as well as the entire model. Some computational results are also presented
Keywords
, Maximal covering, location-allocation, Queueing systems, M/G/1
@article{paperid:1025791,
author = {Moeen Moghadas, Foroogh and Taghizadeh Kakhki, Hossein},
title = {Queueing Covering Maximal Location-Allocation Problem: An Extension with M/G/1 Sysytems},
journal = {Advances in Decision Science},
year = {2011},
volume = {2011},
number = {127},
month = {November},
issn = {2090-3359},
pages = {1--13},
numpages = {12},
keywords = {Maximal covering; location-allocation; Queueing systems; M/G/1},
}
%0 Journal Article
%T Queueing Covering Maximal Location-Allocation Problem: An Extension with M/G/1 Sysytems
%A Moeen Moghadas, Foroogh
%A Taghizadeh Kakhki, Hossein
%J Advances in Decision Science
%@ 2090-3359
%D 2011
