A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Tehran
2012-03-01
|
| Series: | Journal of Sciences, Islamic Republic of Iran |
| Subjects: | |
| Online Access: | https://jsciences.ut.ac.ir/article_24571_3eb964a41c5f135d51aceb5db1223217.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|