This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facility with exponentially distributed service times. Using queueing analysis, we develop a mixd integer mathematical model to minimize the total travel and the average waiting times for customers. In order to evaluate the validity of the proposed model, a numerical example is solved and analyzed using GAMS software. In addition, since the proposed problem is NP-hard, two metaheuristic algorithms including a genetic algorithm and a simulated annealing algorithm are developed and applied for large-size problems.
Jafari, R., & Arkat, J. (2016). Network Location Problem with Stochastic and Uniformly Distributed Demands. International Journal of Engineering, 29(5), 654-662.
MLA
Reza Jafari; Jamal Arkat. "Network Location Problem with Stochastic and Uniformly Distributed Demands". International Journal of Engineering, 29, 5, 2016, 654-662.
HARVARD
Jafari, R., Arkat, J. (2016). 'Network Location Problem with Stochastic and Uniformly Distributed Demands', International Journal of Engineering, 29(5), pp. 654-662.
VANCOUVER
Jafari, R., Arkat, J. Network Location Problem with Stochastic and Uniformly Distributed Demands. International Journal of Engineering, 2016; 29(5): 654-662.