Title of article
A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
Author/Authors
Moeen Moghadas, F. ferdowsi university of mashhad - Faculty of Mathematics and Statistics Science - Department of Mathematics, مشهد, ايران , Taghizadeh Kakhki, H. ferdowsi university of mashhad - Faculty of Mathematics and Statistics Science - Department of Mathematics, مشهد, ايران
From page
67
To page
75
Abstract
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 meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these approaches are compared with the solutions obtained by CPLEX. Results show that using the new procedure in which sub-problems were solved with Branch and bound is better
Keywords
Maximal covering location problems , M , M , 1 queueing system , Heuristics , GRASP
Journal title
Journal of Sciences Islamic Republic of Iran
Journal title
Journal of Sciences Islamic Republic of Iran
Record number
2579988
Link To Document