Various objectives for the queueing-location problem on the plane

The queueing-location problem is formulated in order to find the best location for a service facility which provides a service that requires driving to the location of the customer. Since calls are generated by customers in a random fashion, a queue is formed for service and we need to provide the best service. In this paper, several objectives for the queueing-location problem are considered. Most of these objectives result in the Weber problem. Computational experiments are reported.