NETWORK LOCATION PROBLEM WITH STOCHASTIC AND UNIFORMLY DISTRIBUTED DEMANDS
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...
Saved in:
Published in | International journal of engineering (Tehran) Vol. 29; no. 5; pp. 654 - 662 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
01.05.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 1025-2495 1735-9244 |
DOI: | 10.5829/idosi.ije.2016.29.05b.09 |