Journal of Service Science and Management

Volume 3, Issue 3 (September 2010)

ISSN Print: 1940-9893   ISSN Online: 1940-9907

Google-based Impact Factor: 1.25  Citations  h5-index & Ranking

Optimal Location of Facilities on a Network in Which Each Facility is Operating as an M/G/1 Queue

HTML  Download Download as PDF (Size: 3066KB)  PP. 287-297  
DOI: 10.4236/jssm.2010.33036    5,211 Downloads   9,199 Views   Citations


In this paper, we consider a facility location problem in which customers and facilities are located on a network, and each facility is assumed to be operating as an M/G/1 queuing system. In many situations, the customer chooses the nearest facility to receive service. Customer satisfaction is evaluated by the probability of waiting less than or equal to a certain time for a customer that is chosen randomly from all customers who arrives to the system. By using a computational method for obtaining the probability on the waiting time, we propose the computational heuristic methods for finding the optimal location. Numerical results show the following. First, it is shown that the tabu search with an initial solution generated by random numbers gives the near-optimal solution with the highest probability among several algorithms. Second, the computation time and solution quality are not sensitive to the sharp of the service time distribution. Third, the computation time and solution quality are highly sensitive to the system utilization. Fourth, the complete enumeration might be the best solution methodology for highly utilized systems.

Cite this paper

T. Hamaguchi and K. Nakade, "Optimal Location of Facilities on a Network in Which Each Facility is Operating as an M/G/1 Queue," Journal of Service Science and Management, Vol. 3 No. 3, 2010, pp. 287-297. doi: 10.4236/jssm.2010.33036.

Cited by

[1] Bi-objective optimization approach to a multi-layer location–allocation problem with jockeying
[2] Introduction to location science
[3] On the optimality of the sequential approach for network design problems of service operations
[4] Innovative Method of Urban Planning Management Based on the Mathematical Modelling of the Network Objects
[5] Multiple-server facility location problem with stochastic demands along the network edges
[6] Dynamic Facility Location with Stochastic Demand and Congestion
[7] Location science
Springer International Publishing, 2015
[8] Stochastic Location Models with Congestion
Location Science, 2015
[9] مکان‌یابی برای دو تسهیل مستعد ازدحام با در نظر گرفتن مشتریان کم‌حوصله‎
[10] Network Location Problem for Two Congestible Facilities Considering Impatient Customers

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.