TY - JOUR
ID - 4461
TI - Developing a Two Objectives Model for Maximal Covering Problem Considering Queuing Parameters
JO - Industrial Management Studies
JA - JIMS
LA - en
SN - 2251-8029
AU - Seifbarghy, Mehdi
AU - Forghani, Razieh
AU - Rathi, Zarifeh
AD -
Y1 - 2010
PY - 2010
VL - 8
IS - 18
SP - 1
EP - 13
KW - Location
KW - Maximal Covering, Queue, Genetic Algorithm, Server
DO -
N2 - Maximal Covering Location Problem (MCLP) aims at maximizing a population of customers which are located within a specified range of time or distance from some new servers which should be located. A number of extensions have been proposed for this problem, one of which is considering queuing constraints in the mode; for example, location of a limited number of servers in such a way as to maximize the covering considering the constraint regarding to the queue length. In this paper, we extend the proposed model by Correa and Lorena [3] which maximizes the covering. We consider a more objective function in such a way as to minimize the total distance between the servers and demand points. A genetic algorithm based heuristic is proposed to solve the model and results are compared with that of given by CPLEX as a standard solver to estimate the performance of the given algorithm.
UR - https://jims.atu.ac.ir/article_4461.html
L1 - https://jims.atu.ac.ir/article_4461_78c321168c041af1cdea3cdcf42062c9.pdf
ER -