Queueing Maximal Covering Location-Allocation Problem : An Extension with MG1 Queueing Systems
Joint Authors
Kakhki, Hossein Taghizadeh
Moghadas, Foroogh Moeen
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-13, 13 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-01-29
Country of Publication
Egypt
No. of Pages
13
Main Subjects
Economics & Business Administration
Business Administration
Abstract EN
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.
American Psychological Association (APA)
Moghadas, Foroogh Moeen& Kakhki, Hossein Taghizadeh. 2012. Queueing Maximal Covering Location-Allocation Problem : An Extension with MG1 Queueing Systems. Advances in Decision Sciences،Vol. 2011, no. 2011, pp.1-13.
https://search.emarefa.net/detail/BIM-484497
Modern Language Association (MLA)
Moghadas, Foroogh Moeen& Kakhki, Hossein Taghizadeh. Queueing Maximal Covering Location-Allocation Problem : An Extension with MG1 Queueing Systems. Advances in Decision Sciences No. 2011 (2011), pp.1-13.
https://search.emarefa.net/detail/BIM-484497
American Medical Association (AMA)
Moghadas, Foroogh Moeen& Kakhki, Hossein Taghizadeh. Queueing Maximal Covering Location-Allocation Problem : An Extension with MG1 Queueing Systems. Advances in Decision Sciences. 2012. Vol. 2011, no. 2011, pp.1-13.
https://search.emarefa.net/detail/BIM-484497
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-484497
