Optimal location of a single service center of certain types

✍ Scribed by K. P. K. Nair; R. Chandrasekaran

• Publisher: John Wiley and Sons
• Year: 1971
• Tongue: English
• Weight: 407 KB
• Volume: 18
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800180409

✦ Synopsis

Hakimi has considered the problem of finding an optimal location for a single service center, such as a hospital or a police station. He used a graph theoretic model to represent the regon being serviced. The communities are represented by the nodes while the road network is represented by the arcs of the graph. In his work, the objective is one of minimizing the maximum of the shortest distances between the vertices and the service center. In the present work, the region being serviced is represented by a convex polygon and communities are spread over the entire region. The objective is to minimize the maximum of Euclidian distances between the service center and any point in the polygon. Two methods of solution presented are (i) a geometric method, and (ii) a quadratic programming formulation. Of these, the geometric method is simpler and more efficient. It is seen that for a class of problems, the geometric method is well suited and very efficient while the graph theoretic method, in general, will give only approximate solutions in spite of the increased efforts involved. But, for a different class of problems, the graph theoretic approach will be more appropriate while the geometric method will provide only approximate solutions though with ease. Finally, some feasible applications of importance are outlined and a few meaningful extensions are indicated.