June 2, 2008, 4PM, Burnside 1205
On the collection depots location problems
Binay Bhattacharya
Simon Fraser University
In the classical facility location problem, the service of a customer consists of the travel of a facility center to the customer and back. We consider an extension of the classical facility location problem where, besides a set of customers in some metric space, a set of collection depots are also given. In this setting the service of a customer consists of the travel of a facility center to the customer and return back to the center via a collection depot. In this talk we consider collection depots location problems in networks and Euclidean metric spaces. A survey of the related collection depots problems will be presented followed by a detailed discussion of the algorithms which solve the single facility minmax and minsum collection depots problems in the Euclidean plane.