Application of Queuing Theory for Locating Service Centers by Considering Provides Several Service in That

Mahdi GHAFFARI, Shahram Asgari SOORAN, Sadegh AMIRI
1.839 730

Abstract


One of the factors contributing to the success of the service centers to provide high quality services to customers can be short waiting time for customers to receive service and quick access to a service center for the service is licensed under. In this paper, a model for locating service centers stated that its goal is to minimize travel time and waiting for customers to receive service. The main purpose served by assuming diversity is followed. Serving a variety of different means of providing some kind of service each type of service in each service center is a different and independent.  Since most service centers will provide some kind of service, diversity is supposed to serve many applications and makes precise location of choice for service centers and service providers to choose the number of each type in each center. The proper selection of these two cases, it is very effective in enhancing the quality of service to customers. The problem with this objective and key assumptions, modeling and meta-heuristic algorithms and solving community dispersed particles is investigated. 


Keywords


Location, queuing theory, service diversity, quality of service, distributed particle swarm algorithm

Full Text:

PDF


References


Hakimi, S.L., Optimal locations of switching centers and the absolute centers and medians of a graph, Operational Research,Vol. 12, pp. 450-459. (1964)

Berman, O., Larson, R., Chiu, S. Optimal server location on a network operating as a M/G/1 queue, Operational Research,Vol. 12(4), pp. 746-771. (1985).

Berman, O., Larsen, R., Parken, C. The stochastic queue P-median location problem, Transportation Society, Vol. 21, pp. 207-216. (1987).

Wang, Q., Batta, R., Rump, C.M., Algorithms for a facility location problem with stochastic customer demand and immobile servers, Annals of Operations Research, Vol. 111, pp. 17-34. (2002),

Berman, O., Drezner, Z., The multiple server location problem, Journal of Operational Research society, Vol. 58, pp. 91-99. (2007),

Aboolian, R., Berman, O., Drezner, Z., The multiple server center location problem, Annals of Operations Research, Vol. 167, pp. 337-352. (2008),

Boffy, B.T., Galvao, R.D., Espejo, L., A review of congestion models in the location of facilities with immobile servers, European Journal of Operational Research, Vol. 178, pp. 643- 662. (2007),

Drezner, T., Drezner, Z., The gravity multiple server location problem, Computer and Operation Research, Vol. 38, pp. 694-701. (2011),

Pasandideh, S.H.R., Niaki, S.T.A., Genetic application in a facility location problem with random demand within queuing framework, Journal of Intelligent Manufacturing, DOI: 10.1007/s10845-010-0416-1. (2010),

Seifbarghy, M., Rabieian, R., Karimi, F., Location service centers optimizing customers’ perspective criteria, International Journal of Advanced Manufacturing Technology,Vol. 54, pp. 811-819. (2011),

Klienrock, L., Queuing systems, John Wiley & Sons. (1975),

Kennedy, J., Eberhart, R.C., Particle swarm optimization, In: Proceedings of IEEE International Conference on Neural Network, IV., pp. 1942-1948. (1995),

MATLAB, Version 7.10.0.584., (R2010b), The MathWorks, Inc. Protected by U.S. and international patents.