Title
Optimizing capacity, pricing and location decisions on a congested network with balking.
Abstract
In this paper, we consider the problem of making simultaneous decisions on the location, service rate (capacity) and the price of providing service for facilities on a network. We assume that the demand for service from each node of the network follows a Poisson process. The demand is assumed to depend on both price and distance. All facilities are assumed to charge the same price and customers wishing to obtain service choose a facility according to a Multinomial Logit function. Upon arrival to a facility, customers may join the system after observing the number of people in the queue. Service time at each facility is assumed to be exponentially distributed. We first present several structural results. Then, we propose an algorithm to obtain the optimal service rate and an approximate optimal price at each facility. We also develop a heuristic algorithm to find the locations of the facilities based on the tabu search method. We demonstrate the efficiency of the algorithms numerically.
Year
DOI
Venue
2011
10.1007/s00186-011-0361-6
Math. Meth. of OR
Keywords
Field
DocType
facility location
Mathematical optimization,Heuristic (computer science),Multinomial logistic regression,Queue,Capacity planning,Facility location problem,Exponential distribution,Service time,Tabu search,Mathematics
Journal
Volume
Issue
ISSN
74
2
1432-2994
Citations 
PageRank 
References 
2
0.38
4
Authors
4
Name
Order
Citations
PageRank
Hossein Abouee-Mehrizi1355.52
Sahar Babri220.38
O. Berman31604231.36
Hassan Shavandi416510.08