Maximal Benefit Location Problem for A Congested System

Some servers are to be located at nodes of a network. demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. customers may waive receiving service with a known probability. the objective is to maximize the total benefit. in this paper, the problem is formulated, three solution algorithms are developed and applied to some numerical examples to analyze the results.