Abstract
This paper shows an approximate solution to Multi-Weber Problems with Barriers. By measuring the shortest-path distances of a random Delaunay network, we provide the method to convert Multi-Weber Problems with Barriers into practical p-median problems on discrete networks. And, we verify that several simple model problems can be solved by this method. Moreover, we solved Automated External Defibrillator's Locations in Komaba Research Campus of the University of Tokyo, as a sample Multi-Weber problem with free-shaped obstacles.
